Scheduling jobs that arrive over time
A natural problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time. In this paper we consider the problem of scheduling n jobs that are released over time in order to minimize the average completion time of the set of jobs. In contrast to the problem of minimizing average completion time when all jobs are available at time 0, all the problems that we consider are NP-hard, and essentially nothing was known about constructing good approximations in polynomial time.
We give the first constant-factor approximation algorithms for several variants of the single and parallel machine model. Many of the algorithms are based on interesting algorithmic and structural relationships between preemptive and nonpreemptive schedules and linear programming relaxations of both. Many of the algorithms generalize to the minimization of average weighted completion time as well.
KeywordsCompletion Time Release Date Parallel Machine Identical Machine Short Processing Time
Unable to display preview. Download preview PDF.
- 1.K. R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.Google Scholar
- 3.J. Du, J.Y.-T. Leung, and G.H. Young. Minimizing mean flow time with release time constraints. Technical report, University of Texas at Dallas, 1988.Google Scholar
- 5.W. Horn. Minimizing average flow time with parallel machines. Operations Research, 21:846–847, 1973.Google Scholar
- 7.J. Labetoulle, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinooy Kan. Preemptive scheduling of uniform machines subject to release dates. In W.R. Pulleyblank, editor, Progress in Combinatorial Optimization, pp. 245–261. Academic Press, 1984.Google Scholar
- 8.E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S.C Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin, editors, Handbooks in Operations Research and Management Science, Vol 4., Logistics of Production and Inventory, pages pp 445–522. 1993.Google Scholar
- 9.J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343–362, 1977.Google Scholar
- 10.R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 6:1–12, 1959.Google Scholar
- 11.R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pp. 422–431, Jan. 1993.Google Scholar
- 12.C. Phillips, C. Stein, and J. Wein. Task scheduling in networks. In Proceedings of Fourth Scandinavian Workshop on Algorithm Theory, pages 290–301, 1994.Google Scholar
- 13.W.E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59–66, 1956.Google Scholar