Worst-case performance of critical path type algorithms

International Transactions in Operational Research

Volumn 7, Issue 4-5, 2000, Pages 383-399

  Singh, G ^a   Zinder, Y ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Deterministic scheduling problems; Maximum lateness; Parallel identical machines; Precedence constraints; Worst case analysis

Indexed keywords

EID: 0004481479     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2000.tb00206.x     Document Type: Article

References (11)

1. Brucker, P., Garey, M.R., Johnson, D.S., 1977. Scheduling equal-length tasks under tree-like precedence constraints to minimise maximum lateness. Math. Oper. Res. 2, 275-284.
2. Hu, T.C., 1961. Parallel sequencing and assembly line problems. Operations Research 9, 841-848.
3. Lam, S., Sethi, R., 1977. Worst case analysis of two scheduling algorithms. SIAM J. Comput. 6, 518-536.
4. Lawler, E.L., 1982. Preemptive scheduling of precedence-constrained jobs on parallel machines. In: Demster, M.A.H, Lenstra, J.K., Rinnooy Kan, A.H.G. (Eds.), Deterministic and Stochastic Scheduling, pp. 101-123.
5. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., 1993. Sequencing and scheduling: algorithms and complexity. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (Eds.), Logistics of Production and inventory. Elsevier, Amsterdam.
6. McNaughton, R., 1959. Scheduling with deadline and loss functions. Management Sci. 6, 1-12.
7. Parker, R.G., 1995. Deterministic Scheduling Theory. Chapman and Hall, New York.
8. Schuurman, P., Woeginger, G.J., 1999. Polynomial time approximation algorithms for machine scheduling: ten open problems. J. Sched. 2, 203-213.
9. Singh, G., Zinder, Y., 2000. Worst-case performance of two critical path type algorithms. Asia Pacific J. Oper. Res. 17(1) (to appear).
10. Ullman, J.D., 1975. NP-Complete scheduling problems. J. Comput. System Sci. 10, 384-393.
11. Zinder, Y., Roper, D., 1998. An iterative algorithm for scheduling unit-time operations with precedence constraints to minimise the maximum lateness. Annals of Operations Research 81, 321-340.