Single machine scheduling subject to precedence delays

Discrete Applied Mathematics

Volumn 70, Issue 3, 1996, Pages 247-266

  Finta, Lucian ^a   Zhen, Liu ^a  

^a INRIA   (France)

Author keywords

Complexity; Delivery time; Makespan; Optimal algorithm; Precedence delay; Release time; Scheduling

Indexed keywords

EID: 0007736539     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(96)00110-2     Document Type: Article

References (18)

1. J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Sci. 34 (1988) 391-401.
2. K.R. Baker, Introduction to Sequencing and Scheduling, (Wiley, New York, 1974).
3. E. Balas, J.K. Lenstra and A. Vazacopoulos, One machine scheduling with delayed precedence constraints, CWI Research report BS-R9304 (1993).
4. J. Carlier, The one-machine scheduling problem, E.J.O.R, 11 (1982) 42-47.
5. E.G. Coffman, Jr. and R.L. Graham, optimal scheduling for two-processor systems, Acta Inform. 1 (1972) 200-213.
6. S. Dauzère-Peres and J.B. Lasserre, A modified shifting bottleneck procedure for job-shop scheduling. Int. J. Prod. Res. 31 (1993) 923-932.
7. S. Dauzère-Peres and J.B. Lasserre, Integration of lotsizing and scheduling decisions in a job-shop, E.J.O.R. 75 (1994) 413-426.
8. P. Dileepan and T. Sen, Bicriterion static scheduling research for a single machine, Omega, 16 (1988) 53-59.
9. L. Finta and Z. Liu, Scheduling of parallel programs in single-bus multiprocessor systems, Rapport de Recherche INRIA, No. 2302 (1994).
10. M.R. Garey and D.R. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, (W.H. Freeman, San Francisco, 1979).
11. M.R. Garey, D.R. Johnson, B.B. Simons and R.E. Tarjan, Scheduling unit-time tasks with arbitrary release times and deadlines, SIAM J. Comput. 10 (1981) 256-269.
12. R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic scheduling: a survey, Ann. Discrete. Math. 5 (1979) 287-326.
13. S.K. Gupta and J. Kyparisis, Single machine scheduling research, Omega 15 (1987) 207-227.
14. W.A. Horn, Some simple scheduling algorithms, Naval Res. Logist. Quart. 21 (1974) 177-185.
15. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, CWI Report BS-R8909, 1989.
16. J.D. Ullman, NP-complete scheduling problems, J. Comput. System Sci. 10 (1975) 384-393.
17. B.B. Simons, A fast algorithm for single processor scheduling, Proceedings of the 19-th Annual Symposium on Foundations of Computer Science, Vol. 9 (1978) 246-252.
18. B. Veltman, B. J. Lageweg and J.K. Lenstra, Multiprocessor scheduling with communication delays, Parallel Comput. 16 (1990) 173-182.