On the complexity of scheduling unit-time jobs with OR-precedence constraints

Operations Research Letters

Volumn 33, Issue 6, 2005, Pages 587-596

  Johannes, Berit ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Computational complexity; OR networks; Precedence constraints; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; JOB ANALYSIS; POLYNOMIAL APPROXIMATION;

OR-NETWORKS; POLYNOMIAL-TIME ALGORITHMS; PRECEDENCE CONSTRAINTS;

SCHEDULING;

EID: 24144497725     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.11.009     Document Type: Article

References (21)

1. D. Dolev, and M.K. Warmuth Profile scheduling of opposing forests and level orders SIAM J. Algebraic Discrete Methods 6 1985 665 687
2. M.R. Garey, and D.S. Johnson Scheduling tasks with nonuniform deadlines on two processors J. ACM 23 1976 461 467
3. M.R. Garey, and D.S. Johnson Computers and Intractibility A Guide to the Theory of NP-Completeness 1979 Freemann New York
4. M.R. Garey, D.S. Johnson, and L. Stockmeyer Some simplified NP-complete graph problems Theoret. Comput. Sci. 1 1976 237 267
5. M.R. Garey, D.S. Johnson, R.E. Tarjan, and M. Yannakakis Scheduling opposing forests SIAM J. Algebraic Discrete Methods 4 1983 72 93
6. D.W. Gillies, and J.W.-S. Liu Scheduling tasks with AND/OR precedence constraints SIAM J. Computing 24 1995 797 810
7. M.H. Goldwasser, and R. Motwani Complexity measures for assembly sequences Internat. J. Comput. Geometry Appl. 9 1999 371 418
8. R.L. Graham Bounds on multiprocessing timing anomalies SIAM J. Appl. Math. 17 1969 416 429
9. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling a survey Ann. Discrete Math. 5 1979 287 326
10. T.C. Hu Parallel sequencing and assembly line problems Oper. Res. 9 1961 841 848
11. G. Igelmund, and F.J. Radermacher Algorithmic approaches to preselective strategies for stochastic scheduling problems Networks 13 1983 29 48
12. R.M. Karp Reducibility among combinatorial problems R.E. Miller J.W. Thatcher Complexity of Computer Computations 1972 Plenum Press New York 85 103
13. E.L. Lawler Sequencing jobs to minimize total weighted completion time subject to precedence constraints Ann. Discrete Math. 2 1978 75 90
14. J.K. Lenstra, and A.H.G. Rinnooy Kan Complexity of scheduling under precedence constraints Oper. Res. 26 1978 22 35
15. R.H. Möhring, and F. Stork Linear preselective policies for stochastic project scheduling Math. Methods Oper. Res. 52 2000 501 515
16. R.H. Möhring, M. Skutella, and F. Stork Scheduling with AND/OR precedence constraints SIAM J. Comput. 33 2004 393 415
17. W.E. Smith Various optimizers for single-stage production Naval Res. Logist. Quart. 3 1956 59 66
18. F. Stork, A branch-and-bound algorithm for minimizing expected makespan in stochastic project networks with resource constraints. Technical Report 613, Institut für Mathematik, Technische Universität Berlin, Berlin, Germany, 1998, revised July 2000.
19. F. Stork, Stochastic resource-constrained project scheduling, Ph.D. Thesis, Institut für Mathematik, Technische Universität Berlin, Berlin, Germany, 2001.
20. J.D. Ullman NP-complete scheduling problems J. Comput. System Sci. 10 1975 384 393
21. G. Woeginger, Personal communication with M. Skutella, February 2003, Technische Universität Berlin, Berlin, Germany.