IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v230y2013i3p596-603.html
   My bibliography  Save this article

Server allocation for zero buffer tandem queues

Author

Listed:
  • Yarmand, Mohammad H.
  • Down, Douglas G.

Abstract

In this paper we consider the problem of allocating servers to maximize throughput for tandem queues with no buffers. We propose an allocation method that assigns servers to stations based on the mean service times and the current number of servers assigned to each station. A number of simulations are run on different configurations to refine and verify the algorithm. The algorithm is proposed for stations with exponentially distributed service times, but where the service rate at each station may be different. We also provide some initial thoughts on the impact on the proposed allocation method of including service time distributions with different coefficients of variation.

Suggested Citation

  • Yarmand, Mohammad H. & Down, Douglas G., 2013. "Server allocation for zero buffer tandem queues," European Journal of Operational Research, Elsevier, vol. 230(3), pages 596-603.
    • Handle: RePEc:eee:ejores:v:230:y:2013:i:3:p:596-603
    DOI: 10.1016/j.ejor.2013.05.029
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713004281
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.05.029?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. B. Avi-Itzhak & M. Yadin, 1965. "A Sequence of Two Servers with No Intermediate Queue," Management Science, INFORMS, vol. 11(5), pages 553-564, March.
    2. 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.
    3. Frederick S. Hillier & Kut C. So & Ronald W. Boling, 1993. "Notes: Toward Characterizing the Optimal Allocation of Storage Space in Production Line Systems with Variable Processing Times," Management Science, INFORMS, vol. 39(1), pages 126-133, January.
    4. Laoucine Kerbache & T. van Woensel & R. Andriansyah & F.R.B. Cruz & J. Macgregor Smith, 2010. "Buffer and Server Allocation in General Multi-Server Queueing Networks," Post-Print hal-00521806, HAL.
    5. Heavey, C. & Papadopoulos, H. T. & Browne, J., 1993. "The throughput rate of multistation unreliable production lines," European Journal of Operational Research, Elsevier, vol. 68(1), pages 69-89, July.
    6. Smith, J. MacGregor & Cruz, F.R.B. & van Woensel, T., 2010. "Topological network design of general, finite, multi-server queueing networks," European Journal of Operational Research, Elsevier, vol. 201(2), pages 427-441, March.
    7. Kenichi Futamura, 2000. "The multiple server effect: Optimal allocation of servers to stations with different service‐time distributions in tandem queueing networks," Annals of Operations Research, Springer, vol. 93(1), pages 71-90, January.
    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. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    2. Xinchang Wang & Sigrún Andradóttir & Hayriye Ayhan & Tonghoon Suk, 2020. "Revenue maximization in two‐station tandem queueing systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(2), pages 77-107, March.
    3. Sagron, Ruth & Pugatch, Rami, 2021. "Universal distribution of batch completion times and time-cost tradeoff in a production line with arbitrary buffer size," European Journal of Operational Research, Elsevier, vol. 293(3), pages 980-989.

    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. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    2. Papadopoulos, H. T. & Vidalis, M. I., 2001. "Minimizing WIP inventory in reliable production lines," International Journal of Production Economics, Elsevier, vol. 70(2), pages 185-197, March.
    3. Federico Nuñez-Piña & Joselito Medina-Marin & Juan Carlos Seck-Tuoh-Mora & Norberto Hernandez-Romero & Eva Selene Hernandez-Gress, 2018. "Modeling of Throughput in Production Lines Using Response Surface Methodology and Artificial Neural Networks," Complexity, Hindawi, vol. 2018, pages 1-10, January.
    4. Mehmet Savsar, 2016. "Reliability and availability analysis of a manufacturing line system," Journal of Applied and Physical Sciences, Prof. Vakhrushev Alexander, vol. 2(3), pages 96-106.
    5. 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.
    6. 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.
    7. Cruz, F.R.B. & Van Woensel, T. & Smith, J. MacGregor, 2010. "Buffer and throughput trade-offs in M/G/1/K queueing networks: A bi-criteria approach," International Journal of Production Economics, Elsevier, vol. 125(2), pages 224-234, June.
    8. 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.
    9. 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.
    10. Eva K. Lee & Siddhartha Maheshwary & Jacquelyn Mason & William Glisson, 2006. "Large-Scale Dispensing for Emergency Response to Bioterrorism and Infectious-Disease Outbreak," Interfaces, INFORMS, vol. 36(6), pages 591-607, December.
    11. Konstantinos S. Boulas & Georgios D. Dounias & Chrissoleon T. Papadopoulos, 2023. "A hybrid evolutionary algorithm approach for estimating the throughput of short reliable approximately balanced production lines," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 823-852, February.
    12. Chen, Chin-Tai & Yuan, John, 2004. "Transient throughput analysis for a series type system of machines in terms of alternating renewal processes," European Journal of Operational Research, Elsevier, vol. 155(1), pages 178-197, May.
    13. Tony T. Tran & Meghana Padmanabhan & Peter Yun Zhang & Heyse Li & Douglas G. Down & J. Christopher Beck, 2018. "Multi-stage resource-aware scheduling for data centers with heterogeneous servers," Journal of Scheduling, Springer, vol. 21(2), pages 251-267, April.
    14. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    15. Bertazzi, Luca, 2011. "Determining the optimal dimension of a work-in-process storage area," International Journal of Production Economics, Elsevier, vol. 131(2), pages 483-489, June.
    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. 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.
    18. 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.
    19. Otis B. Jennings, 2008. "Heavy-Traffic Limits of Queueing Networks with Polling Stations: Brownian Motion in a Wedge," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 12-35, February.
    20. Naumov, Valeriy & Martikainen, Olli, 2011. "Method for Throughput Maximization of Multiclass Networks with Flexible Servers," Discussion Papers 1261, The Research Institute of the Finnish Economy.

    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:eee:ejores:v:230:y:2013:i:3:p:596-603. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.