Scheduling with and/or precedence constraints

SIAM Journal on Computing

Volumn 33, Issue 2, 2004, Pages 393-415

  Möhring, Rolf H ^a   Skutella, Martin ^b   Stork, Frederik ^c  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c ILOG Deutschland GmbH   (Germany)

Author keywords

AND OR precedence constraints; Earliest start schedule; Mean payoff games; Project scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; GAME THEORY; JOB ANALYSIS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

AND/OR PRECEDENCE CONSTRAINTS; EARLIEST START SCHEDULE; MEAN PAYOFF GAMES; PROJECT SCHEDULING;

SCHEDULING;

EID: 2342628540     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970037727X     Document Type: Article

References (29)

1. G. M. ADELSON-VELSKY AND E. LEVNER, Project Scheduling in AND/OR Graphs: A Generalization of Dijkstra's Algorithm, Technical report, Department of Computer Science, Holon Academic Institute of Technology, Holon, Israel, 1999.
2. G. M. ADELSON-VELSKY AND E. LEVNER, Project scheduling in AND/OR graphs: A generalization of Dijkstra's algorithm, Math. Oper. Res., 27 (2002), pp. 504-517.
3. G. AUSIELLO, A. D'ATRI, AND D. SACCÀ, Graph algorithms for functional dependency manipulation, J. ACM, 30 (1983), pp. 752-766.
4. G. AUSIELLO, A. D'ATRI, AND D. SACCÀ, Minimal representation of directed hypergraphs, SIAM J. Comput., 15 (1986), pp. 418-431.
5. F. CHAUVET AND J.-M. PROTH, The PERT-Problem with Alternatives: Modelisation and Optimisation, Technical report, Institut National de Recherche en Informatique et en Automatique (INRIA), France, 1999.
6. E. A. DINIC, The fastest algorithm for the PERT problem with AND- and OR-nodes (the newproduct-new technology problem), in Proceedings of the International Conference on Integer Programming and Combinatorial Optimization, R. Kannan and W. R. Pulleyblank, eds., University of Waterloo Press, Waterloo, Canada, 1990, pp. 185-187.
7. W. F. DOWLING AND J. H. GALLIER, Linear-time algorithms for testing satisfiability of prepositional Horn formulae, J. Logic Program., 1 (1984), pp. 267-284.
8. A. EHRENFEUCHT AND J. MYCIELSKI, Positional strategies for mean payoff games, Internat. J. Game Theory, 8 (1979), pp. 109-113.
9. G. GALLO, C. GENTILE, D. PRETOLANI, AND G. RAGO, Max Horn SAT and the minimum cut problem in directed hypergraphs, Math. Programming, 80 (1998), pp. 213-237.
10. G. GALLO, G. LONGO, S. PALLOTTINO, AND S. NGUYEN, Directed hypergraphs and applications, Discrete Appl. Math., 42 (1993), pp. 177-201.
11. D. W. GILLIES, Algorithms to Schedule Tasks with AND/OR Precedence Constraints, Ph.D. thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, 1993.
12. D. W. GILLIES AND J. W.-S. LIU, Scheduling tasks with AND/OR precedence constraints, SIAM J. Comput., 24 (1995), pp. 797-810.
13. M. H. GOLDWASSER AND R. MOTWANI, Complexity measures for assembly sequences, Internat. J. Comput. Geom. Appl., 9 (1999), pp. 371-418.
14. G. IGELMUND AND F. J. RADERMACHER, Algorithmic approaches to preselective strategies for stochastic scheduling problems, Networks, 13 (1983), pp. 29-48.
15. M. JURDZIŃSKI, Deciding the winner in parity games is in UP ∪ co-UP, Inform. Process. Lett., 68 (1998), pp. 119-124.
16. D. E. KNUTH, A generalization of Dijkstra's algorithm, Inform. Process. Lett., 6 (1977), pp. 1-5.
17. B. KORTE, L. LOVÁSZ, AND R. SCHRADER, Greedoids, Springer-Verlag, Berlin, 1991.
18. E. LEVNER, S. C. SUNG, AND M. VLACH, Makespan minimization in projects with threshold activities, Asia-Pacific J. Oper. Res., 19 (2002), pp. 195-204.
19. W. LUDWIG, A subexponential randomized algorithm for the simple stochastic game problem, Inform. and Comput., 117 (1995), pp. 151-155.
20. K. L. MCMILLAN AND D. L. DILL, Algorithms for interface liming verification, in Proceedings of the IEEE International Conference on Computer Design, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 48-51.
21. R. H. MÖHRING, M. SKUTELLA, AND F. STORK, Forcing relations for AND/OR precedence constraints, in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00), ACM, New York, SIAM, Philadelphia, 2000, pp. 235-236.
22. R. H. MÖHRING AND F. STORK, Linear preselective policies for stochastic project scheduling, Math. Methods Oper. Res., 52 (2000), pp. 501-515.
23. N. J. NILSSON, Principals of Artificial Intelligence, Tioga, Palo Alto, CA, 1980.
24. U. SCHWIEGELSHOHN AND L. THIELE, Dynamic min-max problems, Discrete Event Dyn. Syst., 9 (1999), pp. 111-134.
25. C. SCHWINDT, A Branch-and-Bound Algorithm for the Resource-Constrained Project Duration Problem Subject to Temporal Constraints, Technical report 544, WIOR, University of Karlsruhe, Germany, 1998.
26. F. STORK, Stochastic Resource-Constrained Project Scheduling, Ph.D. thesis, Department of Mathematics, Technische Universität Berlin, 2001.
27. J. D. ULLMAN, Principles of Database Systems, 2nd ed., Computer Science Press, Rockville, MD, 1982.
28. J. VÖGE AND M. JURDZIŃSKI, A discrete strategy improvement algorithm for solving parity games, in Proceedings of the 12th International Conference of Computer Aided Verification, CAV 2000, E. A. Emerson and A. P. Sistla, eds., Lecture Notes in Comput. Sci. 1855, Springer-Verlag, Chicago, IL, 2000, pp. 202-215.
29. U. ZWICK AND M. PATERSON, The complexity of mean payoff games on graphs, Theoret. Comput. Sci., 158 (1996), pp. 343-359.