Worst-case performance of two critical path type algorithms

Asia-Pacific Journal of Operational Research

Volumn 17, Issue 1, 2000, Pages 101-122

  Singh, Gaurav ^a   Zinder, Yakov ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

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

Indexed keywords

EID: 0004482632     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. Braschi, B. and D. Trystram (1994), A new insight into the Coffman-Graham algorithm, SIAM Journal on Computing 23, 662-669.
2. Brucker, P., M. R. Garey and D. S. Johnson (1977), Scheduling equal-length tasks under tree-like precedence constraints to minimize maximum lateness, Mathematics of Operations Research 2, 275-284.
3. Chen, N. F. (1975), An Analysis of Scheduling Algorithms in Multiprocessing Computing Systems, Technical Report UIUCDCS-R-75-724, Department of Computer Science, University of Illinois at Urbana-Champaign.
4. Chen, N. F. and C. L. Liu (1975), On a class of scheduling algorithms for multiprocessors computing systems. In T. Y. Feng, ed.: Parallel Processing, Lecture Notes in Computer Science, Vol. 24, Springer, Berlin, 1-16.
5. Coffman, E. G. Jr. and R. L. Graham (1972), Optimal scheduling for two-processor systems, Acta Informatica 1, 200-213.
6. Hu, T. C. (1961), Parallel sequencing and assembly line problems, Operations Research 9, 841-848.
7. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (1993), Sequencing and scheduling: Algorithms and complexity. In S. C. Graves, A. H. G. Rinnooy Kan and P. H. Zipkin, eds.: Logistics of Production and Inventory, Elsevier Science Publishers B.V.
8. Lenstra, J. K. and A. H. G. Rinnooy Kan (1978), Complexity of scheduling under precedence constraints, Operations Research 26, 22-35.
9. Parker, R. G. (1995), Deterministic Scheduling Theory, Chapman & Hall, New York.
10. Ullman, J. D. (1975), NP-complete scheduling problems, Journal of Computer and System Sciences 10, 384-393.
11. Zinder, Y. and D. Roper (1998), An iterative algorithm for scheduling unit-time operations with precedence constraints to minimize the maximum lateness, Annals of Operations Research 81, 321-340.