Hostname: page-component-77c78cf97d-54lbx Total loading time: 0 Render date: 2026-04-24T00:40:52.546Z Has data issue: false hasContentIssue false
  • English
  • Français

On Sequencing Two Types of Tasks on a Single Processor under Incomplete Information

Published online by Cambridge University Press:  27 July 2009

Apostolos N. Burnetas  and
Michael N. Katehakis
Apostolos N. Burnetas
Affiliation:
Graduate School of Management, Rutgers University92 New Street, Newark, New Jersey 07102-1895
Michael N. Katehakis
Affiliation:
Graduate School of Management and RUTCOR Rutgers University92 New Street, Newark, New Jersey 07102-1895
Get access Rights & Permissions [Opens in a new window]

Abstract

Two types of tasks are to be scheduled on a single processor under incomplete information about the task lengths. We derive the structure of optimal scheduling rules w.r.t. flowtime, as well as asymptotic approximations for a large number of tasks, when the length distributions belong to a one-parameter exponential family.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 7 , Issue 1 , January 1993 , pp. 85 - 119
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.Agrawal, R., Hedge, M., & Teneketzis, D. (1988). Asymptotically efficient adaptive allocation rules for the multi-armed bandit problem with switching cost. IEEE Transactions on Automatic Control AC-33: 899–906.CrossRefGoogle Scholar
2.Baker, K.R. (1985). Introduction to sequencing and scheduling. New York: John Wiley.Google Scholar
3.Berry, D.A. & Fristedt, B. (1985). Bandit problems: Sequential allocation of experiments. New York: Chapman and Hall.CrossRefGoogle Scholar
4.Bertsekas, D.P. (1976). Dynamic programming and stochastic control. New York: Academic Press.Google Scholar
5.Bradl, R.N., Johnson, S.M., & Karlin, S. (1956). On sequential designs for maximizing the sum of n observations. Annals of Mathematical Statistics 27: 1060–1074.Google Scholar
6.Cox, D.R. & Hinkley, D.V. (1974). Theoretical statistics. New York: Chapman and Hall.CrossRefGoogle Scholar
7.Dynkin, E.B. & Yushkevich, A.A. (1979). Controlled Markov processes. New York: Springer-Verlag.CrossRefGoogle Scholar
8.Erdélyi, A. (1956). Asymptotic expansions. New York: Dover.Google Scholar
9.Gittins, J.C. & Glazebrook, K.D. (1977). On Bayesian models in stochastic scheduling. Journal of Applied Probability 14: 556–565.CrossRefGoogle Scholar
10.Kullback, S. & Leibler, R.A. (1951). On information and sufficiency. Annals of Mathematical Statistics 22: 79–86.CrossRefGoogle Scholar
11.Kumar, P.R. & Varayia, P. (1986). Stochastic systems: Estimation, identification and adaptive control. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
12.Lai, T.L. (1987). Adaptive treatment allocation and the multi-armed bandit problem. Annals of Statistics 15: 1091–1114.CrossRefGoogle Scholar
13.Lai, T.L. & Robbins, H. (1985). Asymptotically efficient adaptive allocation rules. Advances in Applied Math 6: 4–22.CrossRefGoogle Scholar
14.Whittle, P. (1982). Optimization over time, Vol. 2. New York: John Wiley.Google Scholar