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

Several Results on the Design of Queueing Systems

Author

Listed:
  • Xiuli Chao

    (Department of Industrial Engineering, North Carolina State University, Raleigh, NC 27695)

  • Carlton Scott

    (Graduate School of Management, University of California, Irvine, California 92697)

Abstract

Given that the total service effort in a multiple-server environment is fixed, it is generally known that the single-server system yields the minimum time a customer spends in the system. However, in many manufacturing as well as service applications the waiting time in the queue is more significant than total time in the system. We consider several such queueing design problems and show that the results for minimizing the waiting time in the queue are markedly different from those for minimizing total time in the system.

Suggested Citation

  • Xiuli Chao & Carlton Scott, 2000. "Several Results on the Design of Queueing Systems," Operations Research, INFORMS, vol. 48(6), pages 965-970, December.
    • Handle: RePEc:inm:oropre:v:48:y:2000:i:6:p:965-970
    DOI: 10.1287/opre.48.6.965.12395
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.48.6.965.12395
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.48.6.965.12395?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. Shanthikumar, J. George & Yao, David D., 1986. "The preservation of likelihood ratio ordering under convolution," Stochastic Processes and their Applications, Elsevier, vol. 23(2), pages 259-267, December.
    2. J. George Shanthikumar & David D. Yao, 1987. "Optimal Server Allocation in a System of Multi-Server Stations," Management Science, INFORMS, vol. 33(9), pages 1173-1180, September.
    3. Shaler Stidham, 1970. "On the Optimality of Single-Server Queuing Systems," Operations Research, INFORMS, vol. 18(4), pages 708-732, August.
    4. J. George Shanthikumar & David D. Yao, 1988. "Second-Order Properties of the Throughput of a Closed Queueing Network," Mathematics of Operations Research, INFORMS, vol. 13(3), pages 524-534, August.
    5. Frederick S. Hillier, 1963. "Economic Models for Industrial Waiting Line Problems," Management Science, INFORMS, vol. 10(1), pages 119-130, October.
    6. Ronald W. Wolff, 1982. "Poisson Arrivals See Time Averages," Operations Research, INFORMS, vol. 30(2), pages 223-231, April.
    7. Joel M. Calabrese, 1992. "Optimal Workload Allocation in Open Networks of Multiserver Queues," Management Science, INFORMS, vol. 38(12), pages 1792-1802, 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. Altendorfer, Klaus & Minner, Stefan, 2011. "Simultaneous optimization of capacity and planned lead time in a two-stage production system with different customer due dates," European Journal of Operational Research, Elsevier, vol. 213(1), pages 134-146, August.
    2. Jérémie Gallien & Théophane Weber, 2010. "To Wave or Not to Wave? Order Release Policies for Warehouses with an Automated Sorter," Manufacturing & Service Operations Management, INFORMS, vol. 12(4), pages 642-662, September.

    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. Xiuli Chao & Liming Liu & Shaohui Zheng, 2003. "Resource Allocation in Multisite Service Systems with Intersite Customer Flows," Management Science, INFORMS, vol. 49(12), pages 1739-1752, December.
    2. Bitran, Gabriel R. & Morabito, Reinaldo., 1994. "Open queueing networks : optimization and performance evaluation models for discrete manufacturing systems," Working papers 3743-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. Tianhua Zhang & Juliang Zhang & Fu Zhao & Yihong Ru & John W. Sutherland, 2020. "Allocating resources for a restaurant that serves regular and group-buying customers," Electronic Commerce Research, Springer, vol. 20(4), pages 883-913, December.
    4. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    5. Altendorfer, Klaus & Minner, Stefan, 2011. "Simultaneous optimization of capacity and planned lead time in a two-stage production system with different customer due dates," European Journal of Operational Research, Elsevier, vol. 213(1), pages 134-146, August.
    6. Tetsuji Hirayama, 2003. "Mean sojourn times in multiclass feedback queues with gated disciplines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 719-741, October.
    7. Kochel, Peter, 2004. "Finite queueing systems--structural investigations and optimal design," International Journal of Production Economics, Elsevier, vol. 88(2), pages 157-171, March.
    8. Mohebbi, E., 2008. "A note on a production control model for a facility with limited storage capacity in a random environment," European Journal of Operational Research, Elsevier, vol. 190(2), pages 562-570, October.
    9. Huseyin C. Ozmutlu, 2009. "Markovian analysis for automatic new topic identification in search engine transaction logs," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 25(6), pages 737-768, November.
    10. Koki Inami & Tuan Phung-Duc, 2025. "Analysis of Dynamic Transaction Fee Blockchain Using Queueing Theory," Mathematics, MDPI, vol. 13(6), pages 1-18, March.
    11. Tanja Mlinar & Philippe Chevalier, 2016. "Pooling heterogeneous products for manufacturing environments," 4OR, Springer, vol. 14(2), pages 173-200, June.
    12. Zsolt Saffer & Sergey Andreev & Yevgeni Koucheryavy, 2016. "$$M/D^{[y]}/1$$ M / D [ y ] / 1 Periodically gated vacation model and its application to IEEE 802.16 network," Annals of Operations Research, Springer, vol. 239(2), pages 497-520, April.
    13. Shaked, Moshe & George Shanthikumar, J., 1995. "Hazard rate ordering of k-out-of-n systems," Statistics & Probability Letters, Elsevier, vol. 23(1), pages 1-8, April.
    14. Nitin Kumar, 2025. "Analysis of a manufacturing queueing system using bi-level randomized policy," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 33(1), pages 1-28, April.
    15. Kim, Young Joo & Hwang, Hark, 2009. "Incremental discount policy of cell-phone carrier with connection success rate constraint," European Journal of Operational Research, Elsevier, vol. 196(2), pages 682-687, July.
    16. Hu, Taizhong & Zhu, Zegang, 2001. "An analytic proof of the preservation of the up-shifted likelihood ratio order under convolutions," Stochastic Processes and their Applications, Elsevier, vol. 95(1), pages 55-61, September.
    17. George, David K. & Xia, Cathy H., 2011. "Fleet-sizing and service availability for a vehicle rental system via closed queueing networks," European Journal of Operational Research, Elsevier, vol. 211(1), pages 198-207, May.
    18. Josh Reed & Bo Zhang, 2017. "Managing capacity and inventory jointly for multi-server make-to-stock queues," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 61-94, June.
    19. Lee, Doo Ho & Kim, Bo Keun, 2015. "A note on the sojourn time distribution of an M/G/1 queue with a single working vacation and vacation interruption," Operations Research Perspectives, Elsevier, vol. 2(C), pages 57-61.
    20. Frank Karsten & Marco Slikker & Geert-Jan van Houtum, 2015. "Resource Pooling and Cost Allocation Among Independent Service Providers," Operations Research, INFORMS, vol. 63(2), pages 476-488, April.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:48:y:2000:i:6:p:965-970. 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.