Assigning Priorities (or Not) in Service Systems with Nonlinear Waiting Costs

Published Online:https://doi.org/10.1287/mnsc.2020.3952

References

  • Ansell P, Glazebrook KD, Niño-Mora J, O’Keeffe M (2003) Whittle’s index policy for a multi-class queueing system with convex holding costs. Math. Methods Oper. Res. 57(1):21–39.CrossrefGoogle Scholar
  • Argon NT, Ziya S (2009) Priority assignment under imperfect information on customer type identities. Manufacturing Service Oper. Management 11(4):674–693.LinkGoogle Scholar
  • Argon NT, Ding L, Glazebrook KD, Ziya S (2009) Dynamic routing of customers with general delay costs in a multiserver queuing system. Probab. Engrg. Inform. Sci. 23(2):175–203.CrossrefGoogle Scholar
  • Ata B, Peng X (2018) An equilibrium analysis of a multiclass queue with endogenous abandonments in heavy traffic. Oper. Res. 66(1):163–183.LinkGoogle Scholar
  • Ata B, Tongarlak MH (2013) On scheduling a multiclass queue with abandonments under general delay costs. Queueing Systems 74(1):65–104.CrossrefGoogle Scholar
  • Avi-Itzhak B, Levy H (2004) On measuring fairness in queues. Adv. Appl. Probab. 36(3):919–936.CrossrefGoogle Scholar
  • Bertsimas D (1995) The achievable region method in the optimal control of queueing systems; formulations, bounds and policies. Queueing Syst. 21:337–389.CrossrefGoogle Scholar
  • Bispo CF (2013) The single-server scheduling problem with convex costs. Queueing Systems 73(3):261–294.CrossrefGoogle Scholar
  • Budhiraja A, Ghosh A, Liu X (2014) Scheduling control for Markov-modulated single-server multiclass queueing systems in heavy traffic. Queueing Systems 78(1):57–97.CrossrefGoogle Scholar
  • Cobham A (1954) Priority assignment in waiting line problems. J. Oper. Res. Soc. Amer. 2(1):70–76.LinkGoogle Scholar
  • Cox DR, Smith WL (1961) Queues (Methuen & Co. Ltd., London).Google Scholar
  • Di Crescenzo A (1999) A probabilistic analogue of the mean value theorem and its applications to reliability theory. J. Appl. Probab. 36(3):706–719.CrossrefGoogle Scholar
  • Ding Y, Park E, Nagarajan M, Grafstein E (2019) Patient prioritization in emergency department triage systems: An empirical study of the Canadian triage and acuity scale (CTAS). Manufacturing Service Oper. Management 21(4):723–741.LinkGoogle Scholar
  • El-Taha M, Stidham S Jr (1999) Sample-Path Analysis of Queueing Systems (Kluwer Academic Publishers, Norwell, MA).CrossrefGoogle Scholar
  • Ghahramani S, Wolff RW (1989) A new proof of finite moment conditions for GI/G/1 busy periods. Queueing Systems 4(2):171–178.CrossrefGoogle Scholar
  • Glazebrook KD, Lumley R, Ansell P (2003) Index heuristics for multiclass M/G/1 systems with nonpreemptive service and convex holding costs. Queueing Systems 45(2):81–111.CrossrefGoogle Scholar
  • Gross OA (1962) Preferential arrangements. Amer. Math. Monthly 69(1):4–8.CrossrefGoogle Scholar
  • Gross D, Shortle JF, Thompson JM, Harris C (2008) Fundamentals of Queueing Theory, 4th ed. (John Wiley & Sons, Hoboken, NJ).CrossrefGoogle Scholar
  • Gurvich I, Whitt W (2009) Scheduling flexible servers with convex delay costs in many-server service systems. Manufacturing Service Oper. Management 11(2):237–253.LinkGoogle Scholar
  • Haji R, Newell GF (1971) Optimal strategies for priority queues with nonlinear costs of delay. SIAM J. Appl. Math. 20(2):224–240.CrossrefGoogle Scholar
  • Harrison JM (1975) Dynamic scheduling of a multiclass queue: Discount optimality. Oper. Res. 23(2):270–282.LinkGoogle Scholar
  • Jaiswal NK (1968) Priority Queues (Academic Press, New York).Google Scholar
  • Jenkins J, McCarthy LM, Sauer LM, Green SB, Stuart S, Thomas T, Hsu E (2008) Mass-casualty triage: Time for an evidence-based approach. Prehospital Disaster Medicine 23(1):3–8.CrossrefGoogle Scholar
  • Jiang Y, Tham CK, Ko CC (2002) Delay analysis of a probabilistic priority discipline. Eur. Trans. Telecommunications 13(6):563–577.CrossrefGoogle Scholar
  • Kakalik J, Little J (1971) Optimal service policy for the M/G/1 queue with multiple classes of arrivals. Technical report, Rand Corporation, Santa Monica, CA.Google Scholar
  • Katayama T, Takahashi Y (1992) Analysis of a two-class priority queue with Bernoulli schedules. J. Oper. Res. Soc. Japan 35(3):236–249.Google Scholar
  • Kingman J (1962) The effect of queue discipline on waiting time variance. Math. Proc. Cambridge Philos. Soc., vol. 58 (Cambridge University Press), 163–164.CrossrefGoogle Scholar
  • Kleinrock L (1965) A conservation law for a wide class of queueing disciplines. Naval Res. Logist. Quart. 12(2):181–192.CrossrefGoogle Scholar
  • Klimov G (1974) Time-sharing service systems I. Theory Probab. Appl. 19(3):532–551.CrossrefGoogle Scholar
  • Klimov G (1979) Time-sharing service systems. II. Theory Probab. Appl. 23(2):314–321.CrossrefGoogle Scholar
  • Kulkarni V (2009) Modeling and Analysis of Stochastic Systems, 2nd ed. (CRC Press, Boca Raton, FL).CrossrefGoogle Scholar
  • Larranaga M, Ayesta U, Verloop IM (2015) Asymptotically optimal index policies for an abandonment queue with convex holding cost. Queueing Systems 81(2–3):99–169.CrossrefGoogle Scholar
  • Mandelbaum A, Stolyar AL (2004) Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cµ-rule. Oper. Res. 52(6):836–855.LinkGoogle Scholar
  • Miller DR (1960) Priority queues. Ann. Math. Statist. 31(1):86–103.CrossrefGoogle Scholar
  • Nain P (1989) Interchange arguments for classical scheduling problems in queues. Systems Control Lett. 12(2):177–184.CrossrefGoogle Scholar
  • Ouyang H (2016) Prioritization in service systems with nonlinear delay costs. Unpublished PhD thesis, University of North Carolina at Chapel Hill.Google Scholar
  • Parlar M, Sharafali M (2014) Optimal design of multi-server Markovian queues with polynomial waiting and service costs. Appl. Stochastic Models Bus. Indust. 30(4):429–443.CrossrefGoogle Scholar
  • Pinedo M (1983) Stochastic scheduling with release dates and due dates. Oper. Res. 31(3):559–572.LinkGoogle Scholar
  • Roman S (1980) The formula of Faa di Bruno. Amer. Math. Monthly 87(10):805–809.CrossrefGoogle Scholar
  • Sacco WJ, Navin DM, Fiedler KE, Waddell I, Robert K, Long WB, Buckman RF (2005) Precise formulation and evidence-based application of resource-constrained triage. Acad. Emergency Medicine 12(8):759–770.CrossrefGoogle Scholar
  • Shaked M, Shanthikumar J (2007) Stochastic Orders (Springer Science & Business Media, New York).CrossrefGoogle Scholar
  • Shanthikumar JG, Yao DD (1992) Multiclass queueing systems: Polymatroidal structure and optimal scheduling control. Oper. Res. 40(3):S293–S299.Google Scholar
  • Sun Z, Argon NT, Ziya S (2017) Patient triage and prioritization under austere conditions. Management Sci. 64(10):4471–4489.LinkGoogle Scholar
  • Takács L (1964) Priority queues. Oper. Res. 12(1):63–74.LinkGoogle Scholar
  • Van Mieghem JA (1995) Dynamic scheduling with convex delay costs: The generalized cµ rule. Ann. Appl. Probab. 5(3):809–833.CrossrefGoogle Scholar
  • Vasicek OA (1977) An inequality for the variance of waiting time under a general queuing discipline. Oper. Res. 25(5):879–884.LinkGoogle Scholar
  • Wolff RW (1989) Stochastic Modeling and the Theory of Queues (Pearson College Division, Englewood Cliffs, NJ).Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.