Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm

References

• Adelson-Velsky G. M., Levner E. Routing information flows in networks: A generalization of Dijkstra's algorithm. Proc. Internat. Conf. “Distributed Computer Communication Networks. Theory and Applications” (1999a) November 9–13, 1999(Tel Aviv University, Tel Aviv, Israel) 1–4Google Scholar
• Adelson-Velsky G. M., Levner E.Finding Extremal Paths in AND-OR Graphs: A Generalization of Dijkstra's Algorithm (1999b) . Technical report, Holon Academic Institute of Technology. HAIT Press, Holon, IsraelGoogle Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows. Theory, Algorithms and Applications (1993) (Prentice Hall, Englewood Cliffs, N.J.) Google Scholar
• Chauvet F., Levner E., Proth J-M. On PERT networks with alternatives. (1998) . Research Report No. 3583, INRIA, Le Chesnay Cedex, FranceGoogle Scholar
• Cormen T. H., Leiserson C. E., Rivest R. L.Introduction to Algorithms (1990) (MIT Press, Cambridge, MA) Google Scholar
• Crowston W. Decision CPM: Network reduction and solution. Oper. Res. Quart. (1970) 21(40):435–445Crossref, Google Scholar
• de Mello L. S. H., Sanderson A. C. AND/OR graph representation of assembly plans. IEEE Trans. Robotics Automat. (1990) 6(2):188–199Crossref, Google Scholar
• Dijkstra E. W. A note on two problems in connexion with graphs. Numerische Mathematik (1959) 1:269–271Crossref, Google Scholar
• Dinic E. A. (1984) . Personal communicationGoogle Scholar
• Dinic E. A. The fastest algorithm for the PERT problems with AND- and OR-nodes. Proc. Workshop on Combinatorial Optimization (1990) Waterloo, Ontario, Canada(University of Waterloo Press, Waterloo, Ontario, Canada) 185–187Google Scholar
• Gillies D., Liu J. Scheduling tasks with AND/OR precedence constraints. SIAM J. Comput. (1995) 24(4):787–810Crossref, Google Scholar
• Goldwasser M. H., Motwani R. Complexity measures for assembly sequences. Internat. J. Comput. Geometry Appl. (1999) 9:371–418Crossref, Google Scholar
• Lawler E. L.Combinatorial Optimization: Networks and Matroids (1976) (Holt, Rinehart and Winston, New York) Google Scholar
• Mohring R. H., Skutella M., Stork F.Scheduling with AND/OR Precedence Constraints (2000) . Technical Report No. 689/2000, Technische Universitat Berlin, Berlin, Germany, August 2000Google Scholar
• Schwiegelshohn U., Thiele L. Dynamic min-max problem. Discrete Event Dynam. Sys. (1999) 9:111–134Crossref, Google Scholar