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

TECHNICAL NOTE---Queueing Systems with Synergistic Servers

Author

Listed:
  • Sigrún Andradóttir

    (H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

  • Hayriye Ayhan

    (H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

  • Douglas G. Down

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

Abstract

We consider tandem lines with finite buffers and flexible, heterogeneous servers that are synergistic in that they work more effectively in teams than on their own. Our objective is to determine how the servers should be assigned dynamically to tasks in order to maximize the long-run average throughput. In particular, we investigate when it is better to take advantage of synergy among servers, rather than exploiting the servers' special skills, to achieve the best possible system throughput. We show that when there is no trade-off between server synergy and servers' special skills (because the servers are generalists who are equally skilled at all tasks), the optimal policy has servers working in teams of two or more at all times. Moreover, for Markovian systems with two stations and two servers, we provide a complete characterization of the optimal policy and show that, depending on how well the servers work together, the optimal policy either takes full advantage of servers' special skills, or full advantage of server synergy (and hence there is no middle ground in this case). Finally, for a class of larger Markovian systems, we provide sufficient conditions that guarantee that the optimal policy should take full advantage of server synergy at all times.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:59:y:2011:i:3:p:772-780
    DOI: 10.1287/opre.1110.0934
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1110.0934
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1110.0934?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. 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.
    2. 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.
    3. Noah Gans & Ger Koole & Avishai Mandelbaum, 2003. "Telephone Call Centers: Tutorial, Review, and Research Prospects," Manufacturing & Service Operations Management, INFORMS, vol. 5(2), pages 79-141, September.
    4. 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.
    5. 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)

    Citations

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


    Cited by:

    1. Hyun-Soo Ahn & Mark E. Lewis, 2013. "Flexible Server Allocation and Customer Routing Policies for Two Parallel Queues When Service Rates Are Not Additive," Operations Research, INFORMS, vol. 61(2), pages 344-358, April.
    2. 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.
    3. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2022. "Synchronous resource allocation: modeling, capacity, and optimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1287-1310, December.

    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. 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. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Eugene Furman & Adam Diamant & Murat Kristal, 2021. "Customer Acquisition and Retention: A Fluid Approach for Staffing," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4236-4257, November.
    10. Suri Gurumurthi & Saif Benjaafar, 2004. "Modeling and analysis of flexible queueing systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(5), pages 755-782, August.
    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, 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.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. Rami Atar & Adam Shwartz, 2008. "Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 899-909, November.

    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:59:y:2011:i:3:p:772-780. 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.