Hostname: page-component-89b8bd64d-7zcd7 Total loading time: 0 Render date: 2026-05-06T09:32:46.247Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal Routing and Scheduling of Customers with Deadlines

Published online by Cambridge University Press:  27 July 2009

Panayotis D. Sparaggis  and
Don Towsley
Panayotis D. Sparaggis
Affiliation:
Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, Massachusetts 01003
Don Towsley
Affiliation:
Department of Computer Science, University of Massachusetts, Amherst, Massachusetts 01003
Get access Rights & Permissions [Opens in a new window]

Abstract

Consider the problem in which impatient customers have to be routed to or scheduled from a set of parallel homogeneous service stations with finite buffer capacities. When the service times and the deadlines of customers are exponentially distributed, we identify the control policies that stochastically minimize the total number of losses by any time t. We study systems with deadlines to the beginning or to the end of service. The results regarding the individual types of losses, i.e., losses due to deadline misses and losses due to buffer overflow, vary across different systems. In all cases we state explicitly the properties and the limitations of the optimal control policies.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 8 , Issue 1 , January 1994 , pp. 33 - 49
Copyright
Copyright © Cambridge University Press 1994

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.Bhattacharya, P. & Ephremides, A. (1989). Optimal scheduling with strict deadlines. IEEE Transactions on Automatic Control 34: 721–728.CrossRefGoogle Scholar
2.Bhattacharya, 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
3.Chang, C.S. (1992). A new ordering for stochastic majorization: Theory and applications. Advances in Applied Probability 29: 604–634.CrossRefGoogle Scholar
4.Ephremides, A., Varaiya, P., & Walrand, J. (1980). A simple dynamic routing problem. IEEE Transactions on Automatic Control 25.Google Scholar
5.Hordijk, A. & Koole, G. (1990). On the optimality of the generalized shortest queue policy. Probability in the Engineering and Informational Sciences 4: 477–487.CrossRefGoogle Scholar
6.Johri, P.K. (1989). Optimality of the shortest line discipline with state-dependent service times. European Journal of Operations Research 41: 157–161.CrossRefGoogle Scholar
7.Marshall, A.W. & Olkin, I. (1979). Inequalities: Theory of majorization and its applications. New York: Academic Press.Google Scholar
8.Menich, R. & Serfozo, R.F. (1991). Optimality of routing and servicing in dependent parallel processing systems. Queueing Systems 9: 403–418.CrossRefGoogle Scholar
9.Panwar, S.S., Towsley, D., & Wolf, J. (1988). Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service. Journal of the Association for Computing Machines 35: 832–844.CrossRefGoogle Scholar
10.Ross, S.M. (1983). Stochastic processes. New York: Wiley.Google Scholar
11.Sparaggis, P.D., Towsley, D., & Cassandras, C.G. (1993). Extremal properties of the SNQ and LNQ policies in finite capacity systems with state-dependent service rates. Journal of Applied Probability 30: 223–236.CrossRefGoogle Scholar
12.Sparaggis, P.D., Towsley, D., & Cassandras, C.G., Sample path criteria for weak majorization. Advances in Applied Probability (to appear).Google Scholar
13.Strassen, V. (1956). The existence of probability measures with given marginals. Annals of Mathematical Statistics 36: 423–439.CrossRefGoogle Scholar
14.Towsley, D. & Baccelli, F. (1991). Comparisons of service disciplines in a tandem queueing network with real-time constraints. Operations Research Letters 9: 368–377.Google Scholar
15.Towsley, D., Fdida, S., & Sanioso, H. (1991). Design and analysis of flow control protocols for Metropolitan Area Networks. In Pujolle, G. (ed.), High-capacity local and metropolitan area networks. New York: Springer-Verlag, pp. 471–992.CrossRefGoogle Scholar
16.Towsley, D., Sparaggis, P.D., & Cassandras, C.G. (1992). Optimal routing and buffer allocation for a class of finite capacity queueing systems. IEEE Transactions on Automatic Control 37: 1446–1451.CrossRefGoogle Scholar
17.Walrand, J. (1988). An introduction to queueing networks. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
18.Weber, R.R. (1978). On the optimal assignment of customers to parallel queues. Journal of Applied Probability 15: 406–413.CrossRefGoogle Scholar
19.Whitt, W. (1986). Deciding which queue to join. Operations Research 34: 55–62.CrossRefGoogle Scholar
20.Winston, W. (1977). Optimality of the shortest line discipline. Journal of Applied Probability 14: 181–189.CrossRefGoogle Scholar