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

Dynamic Scheduling for a Flexible Processing Network

Author

Listed:
  • Ick-Hyun Nam

    (College of Business Administration, Seoul National University, Korea 151-742)

Abstract

We study flexible processing systems where there are multiple paths for a certain type of customer to follow through the system. This paper analyzes an open processing network model with discretionary routing. The underlying methodology is the heavy traffic approximation, which has been well publicized by many researchers. Allowing priority sequencing in addition to dynamic routing as our control policy, we show that the balanced workload routing rule does not necessarily give us an optimal solution. In general unbalanced workload routing with priority sequencing is shown to give us better performance than a balanced one. Through some simulation results we compare our recommendation with other scheduling policies for a flexible processing network.

Suggested Citation

  • Ick-Hyun Nam, 2001. "Dynamic Scheduling for a Flexible Processing Network," Operations Research, INFORMS, vol. 49(2), pages 305-315, April.
    • Handle: RePEc:inm:oropre:v:49:y:2001:i:2:p:305-315
    DOI: 10.1287/opre.49.2.305.13527
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.49.2.305.13527
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.49.2.305.13527?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. Lawrence M. Wein, 1991. "Brownian Networks with Discretionary Routing," Operations Research, INFORMS, vol. 39(2), pages 322-340, April.
    2. Ward Whitt, 1980. "Some Useful Functions for Functional Limit Theorems," Mathematics of Operations Research, INFORMS, vol. 5(1), pages 67-85, February.
    3. Lawrence M. Wein, 1992. "Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Network with Controllable Inputs," Operations Research, INFORMS, vol. 40(3-supplem), pages 312-334, June.
    4. Lawrence M. Wein, 1992. "Dynamic Scheduling of a Multiclass Make-to-Stock Queue," Operations Research, INFORMS, vol. 40(4), pages 724-735, August.
    5. Martin I. Reiman, 1984. "Open Queueing Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 441-458, August.
    6. D. J. Houck, 1987. "Comparison of Policies for Routing Customers to Parallel Queueing Systems," Operations Research, INFORMS, vol. 35(2), pages 306-310, April.
    7. Lawrence M. Wein, 1990. "Optimal Control of a Two-Station Brownian Network," Mathematics of Operations Research, INFORMS, vol. 15(2), pages 215-242, May.
    8. Lawrence M. Wein, 1990. "Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs," Operations Research, INFORMS, vol. 38(6), pages 1065-1078, December.
    9. James R. Jackson, 1963. "Jobshop-Like Queueing Systems," Management Science, INFORMS, vol. 10(1), pages 131-142, October.
    10. William P. Peterson, 1991. "A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 90-118, February.
    Full references (including those not matched with items on IDEAS)

    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. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    2. Saulius Minkevičius & Igor Katin & Joana Katina & Irina Vinogradova-Zinkevič, 2021. "On Little’s Formula in Multiphase Queues," Mathematics, MDPI, vol. 9(18), pages 1-15, September.
    3. Lambrecht, Marc R. & Vandaele, Nico J., 1996. "A general approximation for the single product lot sizing model with queueing delays," European Journal of Operational Research, Elsevier, vol. 95(1), pages 73-88, November.
    4. Hong Chen & Xinyang Shen & David D. Yao, 2002. "Brownian Approximations of Multiclass Open-Queueing Networks," Operations Research, INFORMS, vol. 50(6), pages 1032-1049, December.
    5. Barış Ata, 2006. "Dynamic Control of a Multiclass Queue with Thin Arrival Streams," Operations Research, INFORMS, vol. 54(5), pages 876-892, October.
    6. Bertsimas, Dimitris & Paschalidis, Ioannis Ch. & Tsitsiklis, John N., 1992. "Optimization of multiclass queuing networks : polyhedral and nonlinear characterizations of achievable performance," Working papers 3509-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    7. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    8. David M. Markowitz & Martin I. Reiman & Lawrence M. Wein, 2000. "The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies," Operations Research, INFORMS, vol. 48(1), pages 136-154, February.
    9. Martin I. Reiman & Lawrence M. Wein, 1998. "Dynamic Scheduling of a Two-Class Queue with Setups," Operations Research, INFORMS, vol. 46(4), pages 532-547, August.
    10. David M. Markowitz & Lawrence M. Wein, 2001. "Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem," Operations Research, INFORMS, vol. 49(2), pages 246-270, April.
    11. Kim, Ilhyung, 1998. "Managing variances in manufacturing system design," European Journal of Operational Research, Elsevier, vol. 109(3), pages 571-586, September.
    12. Land, Martin & Gaalman, Gerard, 1996. "Workload control concepts in job shops A critical assessment," International Journal of Production Economics, Elsevier, vol. 46(1), pages 535-548, December.
    13. Saif Benjaafar & Yanzhi Li & Dongsheng Xu & Samir Elhedhli, 2008. "Demand Allocation in Systems with Multiple Inventory Locations and Multiple Demand Sources," Manufacturing & Service Operations Management, INFORMS, vol. 10(1), pages 43-60, October.
    14. Martin I. Reiman & Lawrence M. Wein, 1999. "Heavy Traffic Analysis of Polling Systems in Tandem," Operations Research, INFORMS, vol. 47(4), pages 524-534, August.
    15. Saif Benjaafar & Mohsen ElHafsi & Francis de Véricourt, 2004. "Demand Allocation in Multiple-Product, Multiple-Facility, Make-to-Stock Systems," Management Science, INFORMS, vol. 50(10), pages 1431-1448, October.
    16. van Ackere, Ann, 1996. "The management of congestion," European Journal of Operational Research, Elsevier, vol. 89(2), pages 223-225, March.
    17. Ward Whitt, 2001. "The Reflection Map with Discontinuities," Mathematics of Operations Research, INFORMS, vol. 26(3), pages 447-484, August.
    18. repec:dgr:rugsom:95a42 is not listed on IDEAS
    19. Barιş Ata & Deishin Lee & Erkut Sönmez, 2019. "Dynamic Volunteer Staffing in Multicrop Gleaning Operations," Operations Research, INFORMS, vol. 67(2), pages 295-314, March.
    20. Amarjit Budhiraja & Jiang Chen & Sylvain Rubenthaler, 2014. "A Numerical Scheme for Invariant Distributions of Constrained Diffusions," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 262-289, May.
    21. Land, Martin J. & Gaalman, Gerard J.C., 1995. "Workload control concepts in job shops: a critical assessment," Research Report 95A42, University of Groningen, Research Institute SOM (Systems, Organisations and Management).

    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:49:y:2001:i:2:p:305-315. 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.