Hostname: page-component-89b8bd64d-72crv Total loading time: 0 Render date: 2026-05-06T13:01:14.593Z Has data issue: false hasContentIssue false
  • English
  • Français

Stochastic Scheduling in Priority Queues with Strict Deadlines

Published online by Cambridge University Press:  27 July 2009

Dimitrios G. Pandelis  and
Demosthenis Teneketzis
Dimitrios G. Pandelis
Affiliation:
Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, Michigan 48109
Demosthenis Teneketzis
Affiliation:
Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, Michigan 48109
Get access Rights & Permissions [Opens in a new window]

Abstract

Tasks belonging to N priority classes arrive for processing in a single or multiserver facility. If the processing does not begin by a certain time (deterministic or random), the task is lost and a cost is incurred. We determine properties of dynamic, nonidling, nonpreemptive strategies that minimize an infinite horizon expected cost.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 7 , Issue 2 , April 1993 , pp. 273 - 289
Copyright
Copyright © Cambridge University Press 1993

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.)

Article purchase

Temporarily unavailable

References

1.Baccelli, F., Boyer, P., & Hebuterne, G. (1984). Single server queues with impatient customers. Advances in Applied Probability 16: 887–905.CrossRefGoogle Scholar
2.Baccelli, F. & Trivedi, K.S (1985). A single server queue in a hard real time environment. Operations Research Letters 4(4): 161–168.CrossRefGoogle Scholar
3.Bhattacharya, P.P. & Ephremides, A. (1989). Optimal scheduling with strict deadlines. IEEE Transactions on Automatic Control 34: 721–728.CrossRefGoogle Scholar
4.Bhattacharya, P.P. & Ephremides, A. (1991). Optimal allocation of a server between two queues with due times. IEEE Transactions on Automatic Control 36: 1417–1423.CrossRefGoogle Scholar
5.Charlot, F. & Pujolle, G. (1978). Recurrence in single server queues with impatient customers. Annales de l'Institut Henri Poincaré Sec. B XIV: 399–410.Google Scholar
6.Cho, Y. & Sahni, S. (1981). Preemptive scheduling of independent jobs with release and due dates on open, flow and job shops. Operations Research 29: 511–522.CrossRefGoogle Scholar
7.Conway, R.W., Maxwell, W.L., & Miller, L.W. (1967). Theory of scheduling. Reading, MA: Addison-Wesley.Google Scholar
8.Derman, C., Lieberman, G.J., & Ross, S.M. (1978). A renewal decision problem. Management Science 24: 554–563.CrossRefGoogle Scholar
9.Ephremides, A., Varaiya, P., & Walrand, J.C. (1980). A simple dynamic routing problem. IEEE Transactions on Automatic Control AC-25: 690–693.CrossRefGoogle Scholar
10.Huang, C.-C. & Weiss, G. (1992). Scheduling jobs with stochastic processing times and due dates to minimize total tardiness. Preprint.Google Scholar
11.Panwar, S.S., Towsley, D., & Wolff, J.K. (1988). Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service. Journal of Association for Computing Machinery 35(4): 832–844.CrossRefGoogle Scholar
12.Pinedo, M. (1983). Stochastic scheduling with release dates and due dates. Operations Research 31: 559–572.CrossRefGoogle Scholar
13.Ross, S. (1983). Stochastic processes. New York: Wiley.Google Scholar
14.Stanford, R.E. (1979). Reneging phenomena in single channel queues. Mathematics of Operations Research 4: 162–178.CrossRefGoogle Scholar
15.Takacs, L. (1974). A single server queue with limited virtual waiting time. Journal of Applied Probability 11: 612–617.CrossRefGoogle Scholar