Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-23T09:34:49.015Z Has data issue: false hasContentIssue false
  • English
  • Français

MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE

Published online by Cambridge University Press:  31 May 2016

Yang Cao
Yang Cao*
Affiliation:
Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089, USA E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

There are n customers that need to be served by m parallel servers (n≥m). Customer i will only wait in queue for an exponentially distributed time with rate λi before departing the system. The service time on server j is exponentially distributed with rate μj for all customers, and upon completion of service of customer i a positive reward ri is earned. The non-preemptive problem is to choose, after each service completion, which currently in queue customer to serve next. The preemptive problem is to decide when to preempt a service, and to choose, after each service completion or preemption, which currently in queue customer to serve next. The objective of both problems is to maximize the expected total return. We give conditions under which a list policy is optimal for both problems.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 31 , Issue 2 , April 2017 , pp. 226 - 238
Copyright
Copyright © Cambridge University Press 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Argon, N.T., Ziya, S., & Righter, R. (2008). Scheduling impatient jobs in a clearing system with insights on patient triage in mass casualty incidents. Probability in the Engineering and Informational Sciences, 22: 301–332.Google Scholar
2. Atar, R., Giat, C., & Shimkin, N. (2010). The cμ/θ rule for many-server queues with abandonment. Operations Research, 58(5): 1427–1439.Google Scholar
3. Glazebrook, K.D., Ansell, P.S., Dunn, R.T., and Lumley, R.R. (2004). On the optimal allocation of service to impatient tasks. Journal of Applied Probability, 41(1): 51–72.Google Scholar
4. Jang, W. (2002). Dynamic scheduling of stochastic jobs on a single machine. European Journal of Operational Research, 138(3): 518–530.Google Scholar
5. Jang, W. & Klein, C.M. (2002). Minimizing the expected number of tardy jobs when processing times are normally distributed. Operations Research Letters, 30(2): 100–106.Google Scholar
6. Mandelbaum, A. & Momcilovic, P. (2012). Queues with many servers and impatient customers. Mathematics of Operations Research, 37(1): 41–65.Google Scholar
7. Movaghar, A. (1998). On queueing with customer impatience until the beginning of service. Queueing Systems, 29(2–4): 337–350.Google Scholar
8. Movaghar, A. (2006). On queueing with customer impatience until the end of service. Stochastic Models, 22(1): 149–173.Google Scholar
9. Pandelis, D.G. & Teneketzis, D. (1993). Stochastic scheduling in priority queues with strict deadlines. Probability in the Engineering and Informational Sciences, 7(02): 273–289.Google Scholar
10. Panwar, S.S., Towsley, D., & Wolf, J.K. (1988). Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service. Journal of the ACM (JACM), 35(4): 832–844.CrossRefGoogle Scholar
11. Pinedo, M. (1983). Stochastic scheduling with release dates and due dates. Operations Research, 31(3): 559–572.Google Scholar
12. Ross, S.M. (2015). A sequential scheduling problem with impatient jobs. Naval Research Logistics (NRL), 62(8): 659–663.Google Scholar
13. Salch, A., Gayon, J.-P., & Lemaire, P. (2013). Optimal static priority rules for stochastic scheduling with impatience. Operations Research Letters, 41(1): 81–85.Google Scholar
14. Seo, D.K., Klein, C.M., & Jang, W. (2005). Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models. Computers & Industrial Engineering, 48(2): 153–161.Google Scholar
15. Towsley, D. & Panwar, S.S. (1991). Optimality of the stochastic earliest deadline policy for the g/m/c queue serving customers with deadlines. Technical paper available at http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.34.3124&rep=re%p1&type=pdf.Google Scholar
16. Ward, A.R. & Kumar, S. (2008). Asymptotically optimal admission control of a queue with impatient customers. Mathematics of Operations Research, 33(1): 167–202.Google Scholar
17. Zeltyn, S. (2005). Call centers with impatient customers: exact analysis and many-server asymptotics of the M/M/n+ G queue. Ph.D. thesis, Technion-Israel Institute of Technology, Faculty of Industrial and Management Engineering.Google Scholar
18. Zhao, Z.X., Panwar, S.S., & Towsley, D. (1991). 1991 Queueing performance with impatient customers. In INFOCOM ’91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s, IEEE, vol. 1, April, pp. 400–409.Google Scholar