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

Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers

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)

Abstract

For a Markovian queueing network with two stations in tandem, finite intermediate buffer, and M flexible servers, we study how the servers should be assigned dynamically to stations to obtain optimal long-run average throughput. We assume that each server can work on only one job at a time, that several servers can work together on a single job, and that the travel times between stations are negligible. Under these assumptions, we completely characterize the optimal policy for systems with three servers. We also provide a conjecture for the structure of the optimal policy for systems with four or more servers that is supported by extensive numerical evidence. Finally, we develop heuristic server-assignment policies for systems with three or more servers that are easy to implement, robust with respect to the server capabilities, and generally appear to yield near-optimal long-run average throughput.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:53:y:2005:i:3:p:516-531
    DOI: 10.1287/opre.1040.0200
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1040.0200
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1040.0200?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. 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.
    3. Avishai Mandelbaum & Alexander L. Stolyar, 2004. "Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule," Operations Research, INFORMS, vol. 52(6), pages 836-855, December.
    4. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2003. "Dynamic Server Allocation for Queueing Networks with Flexible Servers," Operations Research, INFORMS, vol. 51(6), pages 952-968, December.
    5. John J. Bartholdi & Donald D. Eisenstein, 1996. "A Production Line that Balances Itself," Operations Research, INFORMS, vol. 44(1), pages 21-34, February.
    6. 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.
    7. 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.
    8. Genji Yamazaki & Hirotaka Sakasegawa, 1975. "Properties of duality in tandem queueing systems," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 27(1), pages 201-212, December.
    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. 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.
    2. Down, Douglas G. & Karakostas, George, 2008. "Maximizing throughput in queueing networks with limited flexibility," European Journal of Operational Research, Elsevier, vol. 187(1), pages 98-112, May.
    3. Yi‐Chun Tsai & Nilay Tanık Argon, 2008. "Dynamic server assignment policies for assembly‐type queues with flexible servers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(3), pages 234-251, April.
    4. 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.
    5. Bendel, Dan & Haviv, Moshe, 2018. "Cooperation and sharing costs in a tandem queueing network," European Journal of Operational Research, Elsevier, vol. 271(3), pages 926-933.
    6. Andradóttir, Sigrún & Ayhan, Hayriye, 2021. "Optimizing the interaction between residents and attending physicians," European Journal of Operational Research, Elsevier, vol. 290(1), pages 210-218.
    7. Dimitrios G. Pandelis, 2014. "Optimal control of noncollaborative servers in two‐stage tandem queueing systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(6), pages 435-446, September.
    8. Tuğçe Işık & Sigrún Andradóttir & Hayriye Ayhan, 2016. "Optimal control of queueing systems with non-collaborating servers," Queueing Systems: Theory and Applications, Springer, vol. 84(1), pages 79-110, October.
    9. Gregory Dobson & Hsiao-Hui Lee & Arvind Sainathan & Vera Tilson, 2012. "A Queueing Model to Evaluate the Impact of Patient "Batching" on Throughput and Flow Time in a Medical Teaching Facility," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 584-599, October.
    10. Yun Fong Lim & Bingnan Lu & Rowan Wang & Wenjia Zhang, 2020. "Flexibly Serving A Finite Number of Heterogeneous Jobs in A Tandem System," Production and Operations Management, Production and Operations Management Society, vol. 29(6), pages 1431-1447, June.
    11. 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.
    12. Peng Wang & Kai Pan & Zhenzhen Yan & Yun Fong Lim, 2022. "Managing Stochastic Bucket Brigades on Discrete Work Stations," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 358-373, January.
    13. Gabriel Zayas-Cabán & Jingui Xie & Linda V. Green & Mark E. Lewis, 2016. "Dynamic control of a tandem system with abandonments," Queueing Systems: Theory and Applications, Springer, vol. 84(3), pages 279-293, December.
    14. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2011. "TECHNICAL NOTE---Queueing Systems with Synergistic Servers," Operations Research, INFORMS, vol. 59(3), pages 772-780, June.
    15. Tuğçe Işık & Sigrún Andradóttir & Hayriye Ayhan, 2022. "Dynamic Control of Non‐Collaborative Workers When Reassignment Is Costly," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1332-1352, March.
    16. Aili (Alice) Zou & Douglas G. Down, 2018. "Asymptotically Maximal Throughput in Tandem Systems with Flexible and Dedicated Servers," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-15, October.
    17. 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.
    18. 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.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Peng Wang & Kai Pan & Zhenzhen Yan & Yun Fong Lim, 2022. "Managing Stochastic Bucket Brigades on Discrete Work Stations," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 358-373, January.
    8. Yun Fong Lim & Bingnan Lu & Rowan Wang & Wenjia Zhang, 2020. "Flexibly Serving A Finite Number of Heterogeneous Jobs in A Tandem System," Production and Operations Management, Production and Operations Management Society, vol. 29(6), pages 1431-1447, June.
    9. 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.
    10. Yi‐Chun Tsai & Nilay Tanık Argon, 2008. "Dynamic server assignment policies for assembly‐type queues with flexible servers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(3), pages 234-251, April.
    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. Tuğçe Işık & Sigrún Andradóttir & Hayriye Ayhan, 2016. "Optimal control of queueing systems with non-collaborating servers," Queueing Systems: Theory and Applications, Springer, vol. 84(1), pages 79-110, October.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. Down, Douglas G. & Karakostas, George, 2008. "Maximizing throughput in queueing networks with limited flexibility," European Journal of Operational Research, Elsevier, vol. 187(1), pages 98-112, May.
    20. Emmett J. Lodree & Nezih Altay & Robert A. Cook, 2019. "Staff assignment policies for a mass casualty event queuing network," Annals of Operations Research, Springer, vol. 283(1), pages 411-442, 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:oropre:v:53:y:2005:i:3:p:516-531. 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.