IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v47y2001i10p1421-1439.html
   My bibliography  Save this article

Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems

Author

Listed:
  • Sigrún Andradóttir

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

  • Hayriye Ayhan

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

  • Douglas G. Down

    (Department of Computing and Software, McMaster University, Hamilton, Ontario L8S 4L7 Canada)

Abstract

For a system of finite queues, we study how servers should be assigned dynamically to stations in order to obtain optimal (or near-optimal) long-run average throughput. We assume that travel times between different service facilities are negligible, that each server can work on only one job at a time, and that several servers can work together on one job. We show that when the service rates depend only on either the server or the station (and not both), then all nonidling server assignment policies are optimal. Moreover, for a Markovian system with two stations in tandem and two servers, we show that the optimal policy assigns one server to each station unless that station is blocked or starved (in which case the server helps at the other station), and we specify the criterion used for assigning servers to stations. Finally, we propose a simple server assignment policy for tandem systems in which the number of stations equals the number of servers, and we present numerical results that show that our policy appears to yield near-optimal throughput under general conditions.

Suggested Citation

  • Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2001. "Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems," Management Science, INFORMS, vol. 47(10), pages 1421-1439, October.
    • Handle: RePEc:inm:ormnsc:v:47:y:2001:i:10:p:1421-1439
    DOI: 10.1287/mnsc.47.10.1421.10262
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.47.10.1421.10262
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.47.10.1421.10262?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. Emil Zavadlav & John O. McClain & L. Joseph Thomas, 1996. "Self-Buffering, Self-Balancing, Self-Flushing Production Lines," Management Science, INFORMS, vol. 42(8), pages 1151-1164, August.
    2. Avishai Mandelbaum & Martin I. Reiman, 1998. "On Pooling in Queueing Networks," Management Science, INFORMS, vol. 44(7), pages 971-981, July.
    3. Dimitris Bertsimas & José Niño-Mora, 1999. "Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part II, The Multi-Station Case," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 331-361, May.
    4. 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.
    5. 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.
    6. McClain, John O. & Thomas, L. Joseph & Sox, Charles, 1992. ""On-the-fly" line balancing with very little WIP," International Journal of Production Economics, Elsevier, vol. 27(3), pages 283-289, October.
    7. Frederick S. Hillier & Kut C. So, 1996. "On the Simultaneous Optimization of Server and Work Allocations in Production Line Systems with Variable Processing Times," Operations Research, INFORMS, vol. 44(3), pages 435-443, June.
    8. John J. Bartholdi & Donald D. Eisenstein, 1996. "A Production Line that Balances Itself," Operations Research, INFORMS, vol. 44(1), pages 21-34, February.
    9. Genji Yamazaki & Hirotaka Sakasegawa & J. George Shanthikumar, 1992. "On Optimal Arrangement of Stations in a Tandem Queueing System with Blocking," Management Science, INFORMS, vol. 38(1), pages 137-153, January.
    10. John J. Bartholdi & Donald D. Eisenstein & Robert D. Foley, 2001. "Performance of Bucket Brigades When Work Is Stochastic," Operations Research, INFORMS, vol. 49(5), pages 710-719, October.
    11. John A. Buzacott, 1996. "Commonalities in Reengineered Business Processes: Models and Issues," Management Science, INFORMS, vol. 42(5), pages 768-782, May.
    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. Ramesh Arumugam & Maria Mayorga & Kevin Taaffe, 2009. "Inventory based allocation policies for flexible servers in serial systems," Annals of Operations Research, Springer, vol. 172(1), pages 1-23, November.
    2. Nilay Tanık Argon & Sigrún Andradóttir, 2017. "Pooling in tandem queueing networks with non-collaborative servers," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 345-377, December.
    3. Sennott, Linn I. & Van Oyen, Mark P. & Iravani, Seyed M.R., 2006. "Optimal dynamic assignment of a flexible worker on an open production line with specialists," European Journal of Operational Research, Elsevier, vol. 170(2), pages 541-566, April.
    4. Wallace J. Hopp & Eylem Tekin & Mark P. Van Oyen, 2004. "Benefits of Skill Chaining in Serial Production Lines with Cross-Trained Workers," Management Science, INFORMS, vol. 50(1), pages 83-98, January.
    5. S.M.R. Iravani & J.A. Buzacott & M.J.M. Posner, 2005. "A robust policy for serial agile production systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 58-73, February.
    6. Sigrún Andradóttir & Hayriye Ayhan, 2005. "Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers," Operations Research, INFORMS, vol. 53(3), pages 516-531, June.
    7. Gregory Dobson & Tolga Tezcan & Vera Tilson, 2013. "Optimal Workflow Decisions for Investigators in Systems with Interruptions," Management Science, INFORMS, vol. 59(5), pages 1125-1141, May.
    8. Seyed M. Iravani & Mark P. Van Oyen & Katharine T. Sims, 2005. "Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations," Management Science, INFORMS, vol. 51(2), pages 151-166, February.
    9. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2007. "Compensating for Failures with Flexible Servers," Operations Research, INFORMS, vol. 55(4), pages 753-768, August.
    10. Eser Kırkızlar & Sigrún Andradóttir & Hayriye Ayhan, 2010. "Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(6), pages 563-582, September.
    11. Wallace J. Hopp & Seyed M.R. Iravani & Biying Shou & Robert Lien, 2009. "Design and control of agile automated CONWIP production lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(1), pages 42-56, February.
    12. Eser Kırkızlar & Sigrún Andradóttir & Hayriye Ayhan, 2012. "Flexible Servers in Understaffed Tandem Lines," Production and Operations Management, Production and Operations Management Society, vol. 21(4), pages 761-777, July.
    13. John O. McClain & Kenneth L. Schultz & L. Joseph Thomas, 2000. "Management of Worksharing Systems," Manufacturing & Service Operations Management, INFORMS, vol. 2(1), pages 49-67, July.
    14. Wallace J. Hopp & Seyed M. R. Iravani & Biying Shou, 2005. "Serial Agile Production Systems with Automation," Operations Research, INFORMS, vol. 53(5), pages 852-866, October.
    15. Ward Whitt, 1999. "Partitioning Customers into Service Groups," Management Science, INFORMS, vol. 45(11), pages 1579-1592, November.
    16. Armbruster, Dieter & Gel, Esma S., 2006. "Bucket brigades revisited: Are they always effective?," European Journal of Operational Research, Elsevier, vol. 172(1), pages 213-229, July.
    17. Tanja Mlinar & Philippe Chevalier, 2016. "Pooling heterogeneous products for manufacturing environments," 4OR, Springer, vol. 14(2), pages 173-200, June.
    18. Armbruster, Dieter & Gel, Esma S. & Murakami, Junko, 2007. "Bucket brigades with worker learning," European Journal of Operational Research, Elsevier, vol. 176(1), pages 264-274, January.
    19. 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.
    20. Saied Samiedaluie & Vedat Verter, 2019. "The impact of specialization of hospitals on patient access to care; a queuing analysis with an application to a neurological hospital," Health Care Management Science, Springer, vol. 22(4), pages 709-726, December.

    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:ormnsc:v:47:y:2001:i:10:p:1421-1439. 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.