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

M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules

Author

Listed:
  • A. Federgruen

    (Graduate School of Business, Columbia University, New York, New York 10027)

  • H. Groenevelt

    (Simon School of Business Administration, University of Rochester, Rochester, New York 14627)

Abstract

This paper considers an M/G/c queueing system serving a finite number (J) of distinct customer classes. Performance of the system, as measured by the vector of steady-state expected waiting times of the customer classes (the performance vector), may be controlled by adopting an appropriate priority discipline. We show that the performance space, the set of performance vectors which are achievable under some nonpreemptive work conserving priority rule, is a polyhedron described by 2 J - 1 inequalities. The special (polymatroidal) structure of this polyhedron, nevertheless, allows for efficient (O(J 2 log J)) procedures to minimize any convex (separable) function of the performance vector. Linear objectives are shown to be minimized by absolute priority rules, thus generalizing a well-known result for M/G/1 systems. We also show that each point in the performance space may be achieved by a unique, generalized dynamic priority rule, specified by J - 1 parameters, which may be determined by the recursive solution of J - 1 single variable quadratic equations. This class of rules contains the absolute priority rules and the (pure) dynamic rules as special cases. Our results are accurate up to one, extremely accurate, approximation and completely exact for M/G/1 and M/M/c systems as well as in heavy traffic.

Suggested Citation

  • A. Federgruen & H. Groenevelt, 1988. "M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules," Management Science, INFORMS, vol. 34(9), pages 1121-1138, September.
    • Handle: RePEc:inm:ormnsc:v:34:y:1988:i:9:p:1121-1138
    DOI: 10.1287/mnsc.34.9.1121
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.34.9.1121
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.34.9.1121?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
    ---><---

    Citations

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


    Cited by:

    1. Wenjun Ni & Jia Shu & Miao Song & Dachuan Xu & Kaike Zhang, 2021. "A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 86-104, January.
    2. Lee, Heeseok, 1995. "Assignment of a job load in a distributed system: A multicriteria design method," European Journal of Operational Research, Elsevier, vol. 87(2), pages 274-283, December.
    3. Jasper Vanlerberghe & Tom Maertens & Joris Walraevens & Stijn Vuyst & Herwig Bruneel, 2016. "On the optimization of two-class work-conserving parameterized scheduling policies," 4OR, Springer, vol. 14(3), pages 281-308, September.
    4. R. Garbe & K. D. Glazebrook, 1998. "Submodular Returns and Greedy Heuristics for Queueing Scheduling Problems," Operations Research, INFORMS, vol. 46(3), pages 336-346, June.
    5. Masselink, Inge H.J. & van der Mijden, Thomas L.C. & Litvak, Nelly & Vanberkel, Peter T., 2012. "Preparation of chemotherapy drugs: Planning policy for reduced waiting times," Omega, Elsevier, vol. 40(2), pages 181-187, April.
    6. Vanlerberghe, Jasper & Walraevens, Joris & Maertens, Tom & Bruneel, Herwig, 2018. "Calculation of the performance region of an easy-to-optimize alternative for Generalized Processor Sharing," European Journal of Operational Research, Elsevier, vol. 270(2), pages 625-635.
    7. Muhammad El-Taha, 2017. "A general workload conservation law with applications to queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 361-381, April.
    8. Veeraruna Kavitha & Jayakrishnan Nair & Raman Kumar Sinha, 2019. "Pseudo conservation for partially fluid, partially lossy queueing systems," Annals of Operations Research, Springer, vol. 277(2), pages 255-292, June.
    9. Tianhu Deng & Ying‐Ju Chen & Zuo‐Jun Max Shen, 2015. "Optimal pricing and scheduling control of product shipping," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(3), pages 215-227, April.
    10. Bertsimas, Dimitris. & Niño-Mora, Jose., 1994. "Restless bandit, linear programming relaxations and a primal-dual heuristic," Working papers 3727-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    11. Muhammad El-Taha, 2016. "Invariance of workload in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 181-192, June.
    12. Ryan Palmer & Martin Utley, 2020. "On the modelling and performance measurement of service networks with heterogeneous customers," Annals of Operations Research, Springer, vol. 293(1), pages 237-268, October.
    13. Hayriye Ayhan & Tava Lennon Olsen, 2000. "Scheduling of Multi-Class Single-Server Queues Under Nontraditional Performance Measures," Operations Research, INFORMS, vol. 48(3), pages 482-489, June.
    14. Jing-Sheng Song & Yue Zhang, 2020. "Stock or Print? Impact of 3-D Printing on Spare Parts Logistics," Management Science, INFORMS, vol. 66(9), pages 3860-3878, September.
    15. Bertsimas, Dimitris., 1995. "The achievable region method in the optimal control of queueing systems : formulations, bounds and policies," Working papers 3837-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    16. Dimitris Bertsimas & Vivek F. Farias & Nikolaos Trichakis, 2012. "On the Efficiency-Fairness Trade-off," Management Science, INFORMS, vol. 58(12), pages 2234-2250, 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:34:y:1988:i:9:p:1121-1138. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.