An iterative algorithm for scheduling unit-time tasks with precedence constraints to minimise the maximum lateness

Annals of Operations Research

Volumn 81, Issue , 1998, Pages 321-340

  Zinder, Yakov ^a   Roper, Duncan ^b  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^b UNIVERSITY OF WESTERN SYDNEY   (Australia)

Author keywords

Identical processors; Maximum lateness; Precedence constraints; Scheduling theory; Unit execution times; Worst case analysis

Indexed keywords

EID: 0032380131     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018917426360     Document Type: Article

References (9)

1. B. Braschi and D. Trystram, A new insight into the Coffman-Graham algorithm, SIAM J. Comput. 23(1994)662-669.
2. P. Brucker, M.R. Garey and D.S. Johnson, Scheduling equal-length tasks under tree-like precedence constraints to minimize maximum lateness, Math. Oper. Res. 2(1977)275-284.
3. E.G. Coffman, Jr. and R.L. Graham, Optimal scheduling for two-processor systems, Acta Inform. 1(1972)200-213.
4. M.R. Garey and D.S. Johnson, Scheduling tasks with nonuniform deadlines on two processors, J. Assoc. Comput. Mach. 23(1976)461-467.
5. S. Lam and R. Sethi, Worst case analysis of two scheduling algorithms, SIAM J. Comput. 6(1977) 518-536.
6. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: Logistics of Production and Inventory, eds. S.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin, Elsevier Science, 1993.
7. J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity of scheduling under precedence constraints, Oper. Res. 26(1978)22-35.
8. J.D. Ullman, NP-complete scheduling problems, J. Comput. System Sci. 10(1975)384-393.
9. Y. Zinder, Deterministic service systems with identical processors, in: Proceedings of the 2nd Scientific Conference of Young Scientists of the Mathematical Faculty of Gorky University, 3538-77 Dep., 1977, pp. 82-98 (in Russian).