SCOPUS 정보 검색 플랫폼

Mathematics of Operations Research

Volumn 27, Issue 3, 2002, Pages 504-517

Project scheduling in AND-OR graphs: A generalization of Dijkstra's algorithm

(2) Adelson Velsky, George M a Levner, Eugene b

a BAR ILAN UNIVERSITY (Israel)

b HOLON INSTITUTE OF TECHNOLOGY (Israel)

Author keywords

AND OR graphs; Dijkstra's algorithm; Polynomial algorithm; Project scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; GRAPH THEORY; ITERATIVE METHODS; PERT; POLYNOMIALS; PROBLEM SOLVING; REAL TIME SYSTEMS; SET THEORY; THEOREM PROVING;

REAL-TIME SCHEDULING; SHORTEST PATH PROBLEMS;

SCHEDULING;

EID: 0036672665 PISSN: 0364765X EISSN: None Source Type: Journal
DOI: 10.1287/moor.27.3.504.311 Document Type: Article

Times cited : (11)

References (15)

1
- 0001945739
- Routing information flows in networks: A generalization of Dijkstra's algorithm
- November 9-13, 1999, Tel Aviv University, Tel Aviv, Israel
- (1999) Proc. Internat. Conf. "Distributed Computer Communication Networks. Theory and Applications," , pp. 1-4
- Adelson-Velsky, G.M.¹ Levner, E.²

2
- 0003401029
- Technical report, Holon Academic Institute of Technology. HAIT Press, Holon, Israel
- (1999) Finding Extremal Paths in AND-OR Graphs. A Generalization of Dijkstra's Algorithm

3
- 0003515463
- Prentice Hall, Englewood Cliffs, N.J.
- (1993) Network Flows. Theory, Algorithms and Applications
- Ahuja, R.K.¹ Magnanti, T.L.² Orlin, J.B.³

4
- 0005383722
- Research Report No. 3583, 1NRIA, Le Chesnay Cedex, France
- (1998) On PERT networks with alternatives
- Chauvet, F.¹ Levner, E.² Proth, J.-M.³

5
- 0004116989
- MIT Press, Cambridge, MA
- (1990) Introduction to Algorithms
- Cormen, T.H.¹ Leiserson, C.E.² Rivest, R.L.³

6
- 0014928334
- Decision CPM: Network reduction and solution
- (1970) Oper. Res. Quart. , vol.21 , Issue.40 , pp. 435-445
- Crowston, W.¹

7
- 0025418409
- AND/OR graph representation of assembly plans
- (1990) IEEE Trans. Robotics Automat. , vol.6 , Issue.2 , pp. 188-199
- De Mello, L.S.H.¹ Sanderson, A.C.²

8
- 34147120474
- A note on two problems in connexion with graphs
- (1959) Numerische Mathematik , vol.1 , pp. 269-271
- Dijkstra, E.W.¹

9
- 0005281045
- Personal communication
- (1984)
- Dinic, E.A.¹

10
- 0002284147
- The fastest algorithm for the PERT problems with AND- and OR-nodes
- Waterloo, Ontario, Canada. University of Waterloo Press, Waterloo, Ontario, Canada
- (1990) Proc. Workshop on Combinatorial Optimization , pp. 185-187

11
- 0000047976
- Scheduling tasks with AND/OR precedence constraints
- (1995) SIAM J. Comput. , vol.24 , Issue.4 , pp. 787-810
- Gillies, D.¹ Liu, J.²

12
- 0033409683
- Complexity measures for assembly sequences
- (1999) Internat. J. Comput. Geometry Appl. , vol.9 , pp. 371-418
- Goldwasser, M.H.¹ Motwani, R.²

13
- 0003558735
- Holt, Rinehart and Winston, New York
- (1976) Combinatorial Optimization: Networks and Matroids
- Lawler, E.L.¹

14
- 0003926153
- Technical Report No. 689/2000, Technische Universitat Berlin, Berlin, Germany, August 2000
- (2000) Scheduling with AND/OR Precedence Constraints
- Mohring, R.H.¹ Skutella, M.² Stork, F.³

15
- 0032664259
- Dynamic rain-max problem
- (1999) Discrete Event Dynam. Sys. , vol.9 , pp. 111-134
- Schwiegelshohn, U.¹ Thiele, L.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.