Sadhana

, Volume 22, Issue 2, pp 257–279 | Cite as

On-line maintenance of optimal machine schedules

  • Amril Aman
  • Anantaram Balakrishnan
  • Vijay Chandru
Competitive Manufacturing Systems — Part 2
  • 25 Downloads

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.

Keywords

Scheduling design and analysis of algorithms heuristics 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho A V, Hopcroft J E, Ullman J D 1974The design and analysis of computer algorithms (Reading, MA: Addison-Wesley)MATHGoogle Scholar
  2. 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
  3. 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
  4. Chin F, Houck D 1978 Algorithms for updating minimum spanning trees.J. Comput. Syst. Sci. 16: 333–344MATHCrossRefMathSciNetGoogle Scholar
  5. Chung F R K, Graham R L, Saks M E 1989 A dynamic location problem for graphs.Combinatorica 9: 111–131MATHCrossRefMathSciNetGoogle Scholar
  6. Even S, Shiloach Y 1981 An on-line edge deletion problem.J. Assoc. Comput. Mach. 28: 1–4MATHMathSciNetGoogle Scholar
  7. 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.MATHMathSciNetCrossRefGoogle Scholar
  8. Frederickson G N 1985 Data structures for on-line updating of minimum spanning trees with applications.SIAM J. Comput. 14: 781–798MATHCrossRefMathSciNetGoogle Scholar
  9. 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
  10. Hall L A, Shmoys D 1992 Jackson’s rule: Making a good heuristic better.Math. Oper. Res. 17: 22–35MATHMathSciNetGoogle Scholar
  11. 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
  12. Kise H, Uno M 1978 One-machine scheduling problems with earliest start and due time constraints.Mem. Kyoto Tech. Univ. Sci. Technol. 27: 25–34MathSciNetGoogle Scholar
  13. Lawler E L 1973 Optimal sequencing of a single machine subject to precedence constraints.Manage. Sci. 19: 544–546MATHGoogle Scholar
  14. 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
  15. 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
  16. 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
  17. Overmars M H, van Leeuwen J 1981 Maintenance of configurations in the plane.J. Comput. Syst. Sci. 23: 166–204MATHCrossRefGoogle Scholar
  18. Potts C N 1980 Analysis of a heuristic for one machine sequencing with release dates and delivery times.Oper. Res. 28: 1436–1441MATHMathSciNetCrossRefGoogle Scholar
  19. Ramamritham K, Stankovic J A 1984 Dynamic task scheduling in distributed hard real-time systems.IEEE Software 1: 96–107CrossRefGoogle Scholar
  20. Sahni S, Cho Y 1979 Nearly on line scheduling of a uniform processor system with release times.SIAM J. Comput. 8: 275–285MATHCrossRefMathSciNetGoogle Scholar
  21. Shmoys D, Wein J, Williamson D P 1991 On-line scheduling of parallel machines, preprintGoogle Scholar
  22. Spira P M, Pan A 1975 On finding and updating spanning trees and shortest paths.SIAM J. Comput. 4: 215–225CrossRefMathSciNetGoogle Scholar
  23. Tarjan R E 1983Data structures and network algorithms (Philadelphia, PA: Soc. Ind. Appl. Math.)Google Scholar
  24. 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

Copyright information

© Indian Academy of Sciences 1997

Authors and Affiliations

  • Amril Aman
    • 1
  • Anantaram Balakrishnan
    • 2
  • Vijay Chandru
    • 3
  1. 1.FMIPA IPB, Jalan Raya PadjadjaranBogorIndonesia
  2. 2.Smeal College of Business AdministrationPenn State UniversityUniversity ParkUSA
  3. 3.Department of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations