IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v51y2003i1p123-136.html
   My bibliography  Save this article

Stabilizing Batch-Processing Networks

Author

Listed:
  • J. G. Dai

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205)

  • Caiwei Li

    (Oracle, 300 Oracle Parkway, Room 1084, Redwood City, California 94065)

Abstract

In a batch-processing network, multiple jobs can be formed into a batch to be processed in a single service operation. The network is multiclass in that several job classes may be processed at a server. Jobs in different classes cannot be mixed into a single batch. A batch policy specifies which class of jobs is to be served next. Throughput of a batch-processing network depends on the batch policy used. When the maximum batch sizes are equal to one, the corresponding network is called a standard-processing network, and the corresponding service policy is called a dispatch policy. There are many dispatch policies that have been proven to maximize the throughput in standard networks. This paper shows that any normal dispatch policy can be converted into a batch policy that preserves key stability properties. Examples of normal policies are given. These include static buffer priority (SBP), first-in-first-out (FIFO), and generalized round robin (GRR) policies.

Suggested Citation

  • J. G. Dai & Caiwei Li, 2003. "Stabilizing Batch-Processing Networks," Operations Research, INFORMS, vol. 51(1), pages 123-136, February.
  • Handle: RePEc:inm:oropre:v:51:y:2003:i:1:p:123-136
    DOI: 10.1287/opre.51.1.123.12802
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.51.1.123.12802
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.51.1.123.12802?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Hong Chen & Hanqin Zhang, 1997. "Stability of Multiclass Queueing Networks Under FIFO Service Discipline," Mathematics of Operations Research, INFORMS, vol. 22(3), pages 691-725, August.
    2. J. G. Dai & J. H. Vande Vate, 2000. "The Stability of Two-Station Multitype Fluid Networks," Operations Research, INFORMS, vol. 48(5), pages 721-744, October.
    3. Hong Chen & Hanqin Zhang, 2000. "Stability of Multiclass Queueing Networks Under Priority Service Disciplines," Operations Research, INFORMS, vol. 48(1), pages 26-37, February.
    4. J. G. Dai & G. Weiss, 1996. "Stability and Instability of Fluid Models for Reentrant Lines," Mathematics of Operations Research, INFORMS, vol. 21(1), pages 115-134, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhao, Yaping & Xu, Xiaoyun & Li, Haidong & Liu, Yanni, 2016. "Prioritized customer order scheduling to maximize throughput," European Journal of Operational Research, Elsevier, vol. 255(2), pages 345-356.
    2. J. G. Dai & O. B. Jennings, 2004. "Stabilizing Queueing Networks with Setups," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 891-922, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhao, Yaping & Xu, Xiaoyun & Li, Haidong & Liu, Yanni, 2016. "Prioritized customer order scheduling to maximize throughput," European Journal of Operational Research, Elsevier, vol. 255(2), pages 345-356.
    2. Hong Chen & Hanqin Zhang, 2000. "Stability of Multiclass Queueing Networks Under Priority Service Disciplines," Operations Research, INFORMS, vol. 48(1), pages 26-37, February.
    3. J. G. Dai & J. H. Vande Vate, 2000. "The Stability of Two-Station Multitype Fluid Networks," Operations Research, INFORMS, vol. 48(5), pages 721-744, October.
    4. J. G. Dai & O. B. Jennings, 2004. "Stabilizing Queueing Networks with Setups," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 891-922, November.
    5. Dieter Armbruster & Daniel E. Marthaler & Christian Ringhofer & Karl Kempf & Tae-Chang Jo, 2006. "A Continuum Model for a Re-entrant Factory," Operations Research, INFORMS, vol. 54(5), pages 933-950, October.
    6. Schönlein, Michael & Makuschewitz, Thomas & Wirth, Fabian & Scholz-Reiter, Bernd, 2013. "Measurement and optimization of robust stability of multiclass queueing networks: Applications in dynamic supply chains," European Journal of Operational Research, Elsevier, vol. 229(1), pages 179-189.
    7. Rosario Delgado, 2010. "State space collapse and stability of queueing networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(3), pages 477-499, December.
    8. Legros, Benjamin & Jouini, Oualid & Akşin, O. Zeynep & Koole, Ger, 2020. "Front-office multitasking between service encounters and back-office tasks," European Journal of Operational Research, Elsevier, vol. 287(3), pages 946-963.
    9. Itai Gurvich, 2014. "Validity of Heavy-Traffic Steady-State Approximations in Multiclass Queueing Networks: The Case of Queue-Ratio Disciplines," Mathematics of Operations Research, INFORMS, vol. 39(1), pages 121-162, February.
    10. Kevin D. Glazebrook & José Niño-Mora, 1997. "Assessing an intuitive condition for stability under a range of traffic conditions via a generalised Lu-Kumar network," Economics Working Papers 429, Department of Economics and Business, Universitat Pompeu Fabra, revised Jan 2000.
    11. Heng-Qing Ye & Jihong Ou & Xue-Ming Yuan, 2005. "Stability of Data Networks: Stationary and Bursty Models," Operations Research, INFORMS, vol. 53(1), pages 107-125, February.
    12. Edvinas Greičius & Saulius Minkevičius, 2017. "Diffusion limits for the queue length of jobs in multi-server open queueing networks," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 27(4), pages 71-84.
    13. Koole, Ger & Pot, Auke, 2006. "Workload minimization in re-entrant lines," European Journal of Operational Research, Elsevier, vol. 174(1), pages 216-233, October.
    14. David Gamarnik, 2002. "On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems," Mathematics of Operations Research, INFORMS, vol. 27(2), pages 272-293, May.
    15. A. B. Dieker & J. Shin, 2013. "From Local to Global Stability in Stochastic Processing Networks Through Quadratic Lyapunov Functions," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 638-664, November.
    16. Yongjiang Guo & Xiyang Hou & Yunan Liu, 2021. "A functional law of the iterated logarithm for multi-class queues with batch arrivals," Annals of Operations Research, Springer, vol. 300(1), pages 51-77, May.
    17. Pihnastyi, Oleh & Bondarenko, Kristina, 2016. "About the problem of selecting models for production line," MPRA Paper 91235, University Library of Munich, Germany, revised 07 Jan 2018.
    18. Jan A. Van Mieghem, 2003. "Commissioned Paper: Capacity Management, Investment, and Hedging: Review and Recent Developments," Manufacturing & Service Operations Management, INFORMS, vol. 5(4), pages 269-302, July.
    19. Bruneel, Herwig & Maertens, Tom & Walraevens, Joris, 2014. "Class clustering destroys delay differentiation in priority queues," European Journal of Operational Research, Elsevier, vol. 235(1), pages 149-158.
    20. Heng-Qing Ye & David D. Yao, 2008. "Heavy-Traffic Optimality of a Stochastic Network Under Utility-Maximizing Resource Allocation," Operations Research, INFORMS, vol. 56(2), pages 453-470, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:51:y:2003:i:1:p:123-136. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.