IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v14y2016i3d10.1007_s10288-016-0312-4.html
   My bibliography  Save this article

On the optimization of two-class work-conserving parameterized scheduling policies

Author

Listed:
  • Jasper Vanlerberghe

    (Ghent University (UGent))

  • Tom Maertens

    (Ghent University (UGent))

  • Joris Walraevens

    (Ghent University (UGent))

  • Stijn Vuyst

    (Ghent University (UGent))

  • Herwig Bruneel

    (Ghent University (UGent))

Abstract

Numerous scheduling policies are designed to differentiate quality of service for different applications. Service differentiation can in fact be formulated as a generalized resource allocation optimization towards the minimization of some important system characteristics. For complex scheduling policies, however, optimization can be a demanding task, due to the difficult analytical analysis of the system at hand. In this paper, we study the optimization problem in a queueing system with two traffic classes, a work-conserving parameterized scheduling policy, and an objective function that is a convex combination of either linear, convex or concave increasing functions of given performance measures of both classes. In case of linear and concave functions, we show that the optimum is always in an extreme value of the parameter. Furthermore, we prove that this is not necessarily the case for convex functions; in this case, a unique local minimum exists. This information greatly simplifies the optimization problem. We apply the framework to some interesting scheduling policies, such as Generalized Processor Sharing and semi-preemptive priority scheduling. We also show that the well-documented $$c\mu $$ c μ -rule is a special case of our framework.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:aqjoor:v:14:y:2016:i:3:d:10.1007_s10288-016-0312-4
    DOI: 10.1007/s10288-016-0312-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-016-0312-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10288-016-0312-4?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. Walraevens, Joris & Steyaert, Bart & Bruneel, Herwig, 2008. "Analysis of a discrete-time preemptive resume priority buffer," European Journal of Operational Research, Elsevier, vol. 186(1), pages 182-201, April.
    2. 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.
    3. Walraevens, Joris & Steyaert, Bart & Bruneel, Herwig, 2004. "Performance analysis of a GI-Geo-1 buffer with a preemptive resume priority scheduling discipline," European Journal of Operational Research, Elsevier, vol. 157(1), pages 130-151, August.
    4. J. Michael Harrison, 1975. "Dynamic Scheduling of a Multiclass Queue: Discount Optimality," Operations Research, INFORMS, vol. 23(2), pages 270-282, April.
    5. A. Federgruen & H. Groenevelt, 1988. "Characterization and Optimization of Achievable Performance in General Queueing Systems," Operations Research, INFORMS, vol. 36(5), pages 733-741, October.
    6. Kim, Kilhwan & Chae, Kyung C., 2010. "Discrete-time queues with discretionary priorities," European Journal of Operational Research, Elsevier, vol. 200(2), pages 473-485, January.
    7. Walraevens, Joris & Maertens, Tom & Bruneel, Herwig, 2013. "A semi-preemptive priority scheduling discipline: Performance analysis," European Journal of Operational Research, Elsevier, vol. 224(2), pages 324-332.
    8. M. Dacre & K. Glazebrook & J. Niño‐Mora, 1999. "The achievable region approach to the optimal control of stochastic systems," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 61(4), pages 747-791.
    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. Arnaud Devos & Joris Walraevens & Dieter Fiems & Herwig Bruneel, 2022. "Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline," Annals of Operations Research, Springer, vol. 310(2), pages 477-503, March.
    2. Arnaud Devos & Joris Walraevens & Dieter Fiems & Herwig Bruneel, 2020. "Analysis of a discrete-time two-class randomly alternating service model with Bernoulli arrivals," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 133-152, October.
    3. Arnaud Devos & Joris Walraevens & Dieter Fiems & Herwig Bruneel, 2021. "Heavy-Traffic Comparison of a Discrete-Time Generalized Processor Sharing Queue and a Pure Randomly Alternating Service Queue," Mathematics, MDPI, vol. 9(21), pages 1-25, October.

    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. Esther Frostig & Gideon Weiss, 2016. "Four proofs of Gittins’ multiarmed bandit theorem," Annals of Operations Research, Springer, vol. 241(1), pages 127-165, June.
    2. 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.
    3. Muhammad El-Taha, 2016. "Invariance of workload in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 181-192, June.
    4. José Niño-Mora, 2006. "Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 50-84, February.
    5. José Niño-Mora, 2000. "On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices," Economics Working Papers 456, Department of Economics and Business, Universitat Pompeu Fabra.
    6. José Niño-Mora, 2000. "Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs," Economics Working Papers 514, Department of Economics and Business, Universitat Pompeu Fabra.
    7. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    8. 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.
    9. Walraevens, Joris & Maertens, Tom & Bruneel, Herwig, 2013. "A semi-preemptive priority scheduling discipline: Performance analysis," European Journal of Operational Research, Elsevier, vol. 224(2), pages 324-332.
    10. 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.
    11. 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.
    12. Sai Rajesh Mahabhashyam & Natarajan Gautam & Soundar R. T. Kumara, 2008. "Resource-Sharing Queueing Systems with Fluid-Flow Traffic," Operations Research, INFORMS, vol. 56(3), pages 728-744, June.
    13. Dimitris Bertsimas & José Niño-Mora, 1994. "Restless bandits, linear programming relaxations and a primal-dual index heuristic," Economics Working Papers 301, Department of Economics and Business, Universitat Pompeu Fabra, revised Oct 1997.
    14. 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.
    15. Baris Ata & Yichuan Ding & Stefanos Zenios, 2021. "An Achievable-Region-Based Approach for Kidney Allocation Policy Design with Endogenous Patient Choice," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 36-54, 1-2.
    16. 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.
    17. R. T. Dunn & K. D. Glazebrook, 2004. "Discounted Multiarmed Bandit Problems on a Collection of Machines with Varying Speeds," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 266-279, May.
    18. Hellerstein, Lisa & Lidbetter, Thomas, 2023. "A game theoretic approach to a problem in polymatroid maximization," European Journal of Operational Research, Elsevier, vol. 305(2), pages 979-988.
    19. 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.
    20. 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.

    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:spr:aqjoor:v:14:y:2016:i:3:d:10.1007_s10288-016-0312-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.