Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho A V, Hopcroft J E, Ullman J D 1974The design and analysis of computer algorithms (Reading, MA: Addison-Wesley)
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–386
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–382
Chin F, Houck D 1978 Algorithms for updating minimum spanning trees.J. Comput. Syst. Sci. 16: 333–344
Chung F R K, Graham R L, Saks M E 1989 A dynamic location problem for graphs.Combinatorica 9: 111–131
Even S, Shiloach Y 1981 An on-line edge deletion problem.J. Assoc. Comput. Mach. 28: 1–4
Graham R L, Lawler E L, Lenstra J K, Rinnooy Kan A H G 1979 Optimization and approximation in deterministic sequencing and scheduling: A survey.Ann. Discrete Math. 5: 287–326.
Frederickson G N 1985 Data structures for on-line updating of minimum spanning trees with applications.SIAM J. Comput. 14: 781–798
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)
Hall L A, Shmoys D 1992 Jackson’s rule: Making a good heuristic better.Math. Oper. Res. 17: 22–35
Jackson J R 1955 Scheduling a production line to minimize maximum tradiness. Research Report 43, Management Science Research Project, University of California, Los Angeles
Kise H, Uno M 1978 One-machine scheduling problems with earliest start and due time constraints.Mem. Kyoto Tech. Univ. Sci. Technol. 27: 25–34
Lawler E L 1973 Optimal sequencing of a single machine subject to precedence constraints.Manage. Sci. 19: 544–546
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)
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–205
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–333
Overmars M H, van Leeuwen J 1981 Maintenance of configurations in the plane.J. Comput. Syst. Sci. 23: 166–204
Potts C N 1980 Analysis of a heuristic for one machine sequencing with release dates and delivery times.Oper. Res. 28: 1436–1441
Ramamritham K, Stankovic J A 1984 Dynamic task scheduling in distributed hard real-time systems.IEEE Software 1: 96–107
Sahni S, Cho Y 1979 Nearly on line scheduling of a uniform processor system with release times.SIAM J. Comput. 8: 275–285
Shmoys D, Wein J, Williamson D P 1991 On-line scheduling of parallel machines, preprint
Spira P M, Pan A 1975 On finding and updating spanning trees and shortest paths.SIAM J. Comput. 4: 215–225
Tarjan R E 1983Data structures and network algorithms (Philadelphia, PA: Soc. Ind. Appl. Math.)
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–111
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aman, A., Balakrishnan, A. & Chandru, V. On-line maintenance of optimal machine schedules. Sadhana 22, 257–279 (1997). https://doi.org/10.1007/BF02744492
Issue Date:
DOI: https://doi.org/10.1007/BF02744492