Makespan minimization in projects with threshold activities

Asia-Pacific Journal of Operational Research

Volumn 19, Issue 2, 2002, Pages 195-204

  Levner, Eugene ^a   Sung, Shao Chin ^b   Vlach, Milan ^b  

^a HOLON INSTITUTE OF TECHNOLOGY   (Israel)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

AND OR graphs; Dijkstra type algorithm; Project scheduling; Threshold activities

Indexed keywords

ALGORITHMS; GRAPH THEORY; LOGIC GATES; LOGIC PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; THRESHOLD LOGIC;

THRESHOLD ACTIVITIES;

OPERATIONS RESEARCH;

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

References (16)

1. Chauvet, F., E. Levner and J. M. Proth (1998), On PERT Models with Alternatives, Technical Report No. 3583, INRIA-Lorraine, Metz, France.
2. Cormen, T. H., C. E. Leiserson and R. Rivest (1990), Introduction to Algorithms, MIT Press.
3. Crowston, W. (1970), Decision CPM: Network reduction and solution, Operations Research Quarterly 21 (40), 435-445.
4. Crowston, W. and G. L. Thompson (1967), Decision CPM: A method for simultaneous planning, scheduling and control of projects, Operations Research 15, 407.
5. Dinic, E. (1990), The fastest algorithm for the PERT problem with AND-and OR-nodes, In Proceedings of the International Conference on Integer Programming and Combinatorial Optimization, University of Waterloo Press, Waterloo, Canada, 185-187.
6. Eisner, H. (1963), A generalized network approach to the planning and scheduling of a research project, Journal of the Operational Research Society 10 (1), 115-125.
7. Elmaghraby, S. E. (1964), An algebra for the analysis of generalized activity networks, Management Science 10 (3), 494-514.
8. Gillies, D. W. and J. W. S. Liu (1995), Scheduling tasks with AND/OR precedence constraints, SIAM Journal on Computing 24 (4), 797-810.
9. Goldwasser, M. H. and R. Motwani (1999), Complexity measure for assembly sequences, International Journal of Computational Geometry Applications 9, 371-417.
10. Huckenbeck, U. (1997), Extremal Paths in Graphs: Foundations, Search Strategies and Related Topics, Academie Verlag, Berlin.
11. Kanal, L. N. and V. Kumar (1988), Search in Artificial Intelligence, Springer, Berlin.
12. Martelli, A. (1977), On the complexity of admissible search algorithms, Artificial Intelligence 8, 1-13.
13. Martelli, A. and U. Montanari (1973), Additive AND/OR graphs, In Proceedings of the Third International Joint Conference on Artificial Intelligence (IJCAI-73), Stanford University, Stanford, 1-11.
14. Möhring, R. H., M. Skutella and F. Stork (1998), Forcing Relations for AND/OR Precedence Constraints, Technical Report 646/1998, Technische Universität Berlin, Department of Mathematics, Germany.
15. Neumann, K. (1975), Operations Research Verfahren, Vol. III: Graphentheorie, Netzplantechnik. Hanser, Munchen.
16. Nilson, N. J. (1982), Principles of Artificial Intelligence, Springer, Berlin.