On-line maintenance of optimal machine schedules
- 23 Downloads
Effective and efficient scheduling in a dynamically changing environment is important for real-time control of manufacturing, computer, and telecommunication systems. This paper illustrates the algorithmic and analytical issues associated with developing efficient and effective methods to update schedules on-line. We consider the problem of dynamically scheduling precedence-constrained jobs on a single processor to minimize the maximum completion time penalty. We first develop an efficient technique to reoptimize a rolling schedule when new jobs arrive. The effectiveness of reoptimizing the current schedule as a long-term on-line strategy is measured by bounding its performance relative to oracles that have perfect information about future job arrivals.
KeywordsScheduling design and analysis of algorithms heuristics
Unable to display preview. Download preview PDF.
- Baker K R, Lawler E L, Lenstra J K, Rinnooy Kan A H G 1983 Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints.Oper. Res. 31: 381–386Google Scholar
- Borodin A, Linial N, Saks M 1987 An optimal on-line algorithm for metrical task systems.Proc. of 19th ACM Symposium on Theory of Computing, pp 373–382Google Scholar
- Frederickson G N, Srinivas M A 1984 On-line updating of degree-constrained minimum spanning trees.Proceedings of the 22nd Allerton Conference on Communication, Control, and Computing, October (New York: IEEE Press)Google Scholar
- Jackson J R 1955 Scheduling a production line to minimize maximum tradiness. Research Report 43, Management Science Research Project, University of California, Los AngelesGoogle Scholar
- Lawler E L, Lenstra J K, Rinnooy Kan A H G 1982 Recent developments in deterministic sequencing and scheduling: A survey. InDeterministic and stochastic scheduling (eds) M A H Dempster, J K Lenstra, A H G Rinnooy Kan (Dordrecht: Riedel)Google Scholar
- Malone T W, Fikes R E, Grant K R, Howard M T 1988 Enterprise: A market-like task scheduler for distributed computing environments. InThe ecology of computation (ed) B A Huberman (Amsterdam: Elsevier Science) pp 177–205Google Scholar
- Manasse M S, McGeoch L A, Sleator D D 1988 Competitive algorithms for on-line problems.Proc. 20th ACM Symposium on Theory of Computing (New York: ACM Press) pp 322–333Google Scholar
- Shmoys D, Wein J, Williamson D P 1991 On-line scheduling of parallel machines, preprintGoogle Scholar
- Tarjan R E 1983Data structures and network algorithms (Philadelphia, PA: Soc. Ind. Appl. Math.)Google Scholar
- Zhao W, Ramamritham K 1985 Distributed scheduling using bidding and focused addressing.Proceedings of the Symposium on Real-time Systems (New York: IEEE Press) pp 103–111Google Scholar