Phase transitions in project scheduling

Journal of the Operational Research Society

Volumn 50, Issue 2, 1999, Pages 148-156

  Herroelen, W ^a   Reyck, B De ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Phase transitions; Project management; Scheduling

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY;

RESOURCE-CONSTRAINED PROJECT SCHEDULING;

SCHEDULING;

EID: 0033077946     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600680     Document Type: Article

References (64)

1. Karp RM (1975). On the computational complexity of combinatorial problems. Networks 5: 45-68.
2. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP Completeness. Freeman: San Francisco.
3. Turner JS (1988). Almost all k-colourable graphs are easy to colour. J Algorithms 9: 63-82.
4. Cheeseman P, Kanefsky B and Taylor WM (1991). Where the really hard problems are. Proceedings of the International Joint Conference of Artificial Intelligence 1: 331-337.
5. Hayes B (1997). Can’t get no satisfaction. Am Sci 85: 108-112.
6. Huberman BA and Hogg T (1987). Phase transitions in artificial intelligence systems. Artificial Intelligence 33: 155-171.
7. Hogg T, Hubermann BA and Williams CP (1996). Phase transitions and the search problem. Artificial Intelligence 81: 15.
8. Crawford JM and Auton LD (1993). Experimental results on the crossover point in random 3-SAT. Artificial Intelligence 81: 3157.
9. Freeman JW (1996). Hard random 3-SAT problems and the Davis-Putnam procedure. Artificial Intelligence 81: 183-198.
10. Gent IP and Walsh T (1994). The SAT phase transition. Proceedings ECAI 94: 105-109.
11. Gent IP and Walsh T (1996). The satisfiability constraint gap. Artificial Intelligence 81: 59-80.
12. Kirkpatrick S and Selman B (1994). Critical behavior in the satisfiability of random boolean expressions. Science 264: 1297-1301.
13. Mitchell DG and Levesque HJ (1996). Some pitfalls for experimenters with random SAT. Artificial Intelligence 81: 125.
14. Mitchell DG, Selman B and Levesque HJ (1992). Hard and easy distributions of SAT problems. Proceedings AAAI 92: 459-465.
15. Schrag R and Crawford JM (1996). Implicates and prime implicates in random 3-SAT. Artificial Intelligence 81: 199-222.
16. Selman B and Kirkpatrick S (1996). Critical behavior in the computational cost of satisfiability testing. Artificial Intelligence 81: 273-295.
17. Selman B, Mitchell DG and Levesque HJ (1996). Generating hard satisfiability problems. Artificial Intelligence 81: 17-29.
18. Bollobas B (1985). Random Graphs. Academic Press: New York.
19. Hogg T (1996). Refining the phase transition in combinatorial search. Artificial Intelligence 81: 127-154.
20. Gent IP and Walsh T (1994). Computational phase transitions in real problems. Research paper 724, Department of Artificial Intelligence, Edingburgh University.
21. Gent IP and Walsh T (1995). The TSP phase transition, Technical Report, Department of Computer Science, University of Strathclyde, Scotland.
22. Zhang W and Korf RE (1996). A study of complexity transitions on the asymmetric travelling salesman problem. Artificial Intelligence 81: 223-239.
23. Karp RM and Pearl J (1983). Searching for an optimal path in a tree with random costs. Artificial Intelligence 21: 99-117.
24. McDiarmid CJH (1990). Probabilistic analysis of tree search. In: Gummett GR and Welsh DJA (eds). Disorder in Physical Systems. Oxford Science: Oxford, pp 249-260.
25. McDiarmid CJH and Provan GMA (1991). An expected cost analysis of backtracking and non-backtracking algorithms. Proceedings IJCAI91: 173-177.
26. Pemberton JC and Zhang W (1996). Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems. Artificial Intelligence 81: 297-325.
27. Zhang W and Korf RE (1992). An average case analysis of branch-and-bound with applications: Summary of results. Proceedings AAAI 92: 545-550.
28. Zhang W and Korf RE (1993). Depth-first vs. Best-first search: New results. Proceedings AAAI 93: 769-775.
29. Zhang W and Korf RE (1995). Performance of linear-space search algorithms. Artificial Intelligence 79: 241-292.
30. Jensen TR and Toft B (1995). Graph Colouring Problems. John Wiley and Sons: New York.
31. Little JDC, Murty KG, Sweeney DW and Karel C (1963). An algorithm for the travelling salesman problem. Ops Res 11: 972-989.
32. Davis EW (1975). Project network summary measures and constrained resource scheduling. IIE Trans 7: 132-142.
33. Patterson JH (1976). Project scheduling: The effects of problem structure on heuristic performance. Nav Res Logist 23: 95-123.
34. Elmaghraby SE and Herroelen WS (1980). On the measurement of complexity in activity networks. Eur J Opl Res 5: 223-234.
35. De Reyck B (1998). Scheduling projects with generalized precedence relations—Exact and heuristic procedures. Ph.D. dissertation, Department of Applied Economics, Katholieke Universiteit Leuven (Belgium).
36. Pascoe TL (1966). Allocation of resources—CPM. Rev fr Rech oper 38: 31-38.
37. Davies EM (1974). An experimental investigation of resource allocation in multiactivity projects. Opl Res Q 24: 587-591.
38. Kaimann RA (1974). Coefficient of network complexity. Mgmt Sci 21: 172-177.
39. Kaimann RA (1975). Coefficient of network complexity: Erratum. Mgmt Sci 21: 1211-1212.
40. Kurtulus IS and Narula SC (1985). Multi-project scheduling: Analysis of project performance. IIE Trans 17: 58-66.
41. Patterson JH (1984). A comparison of exact procedures for solving the multiple resource-constrained project scheduling problem. Mgmt Sci 30: 854-867.
42. Talbot FB (1982). Resource-constrained project scheduling problem with time-resource trade-offs: The nonpreemptive case. Mgmt Sci 28: 1197-1210.
43. Kolisch R, Sprecher A and Drexl A (1995). Characterization and generation of a general class of resource-constrained project scheduling problems. Mgmt Sci 41: 1693-1703.
44. Alvarez-Valdes R and Tamarit JM (1989). Heuristic algorithms for resource-constrained project scheduling. In: Slowinski R and Weglarz J (eds). Advances in Project Scheduling. Elsevier: Amsterdam, pp 134-143.
45. Mastor AA (1970). An experimental and comparative evaluation of production line balancing techniques. Mgmt Sci 16: 728-746.
46. Kao EPC and Queranne M (1982). On dynamic programming methods for assembly line balancing. Ops Res 30: 375-390.
47. Dar-El EM (1973). MaLB—A heuristic technique for balancing large single-model assembly lines. AIIE Trans 5: 343-356.
48. De Reyck B (1995). On the use of the restrictiveness as a measure of complexity for resource-constrained project scheduling. Research Report 9535, Department of Applied Economics, Katholieke Universiteit Leuven, Belgium.
49. Thesen A (1977). Measures of the restrictiveness of project networks. Networks 7: 193-208.
50. Bein WW, Kamburowski J and Stallmann MFM (1992). Optimal reduction of two-terminal directed acyclic graphs. SIAM J on Comp 21: 1112-1129.
51. De Reyck B and Herroelen W (1996). On the use of the complexity index as a measure of complexity in activity networks. Eur J Opl Res 91: 347-366.
52. Herroelen W, Demeulemeester E and De Reyck B (1998). A classification scheme for project scheduling problems. In: Weglarz J (ed). Project scheduling: Recent models, algorithms and applications (Chapter 1). Kluwer Academic Publishers, Boston, USA.
53. Herroelen W, De Reyck B and Demeulemeester E (1998). Resource-constrained project scheduling: A survey of recent developments. Comp and Opns Res 25: 279-302.
54. Demeulemeester E and Herroelen W (1992). A branch-and- bound procedure for the multiple resource-constrained project scheduling problem. Mgmt Sci 38: 1803-1818.
55. Demeulemeester E and Herroelen W (1997). New benchmark results for the resource-constrained project scheduling problem. Mgmt Sci 43: 1485-1492.
56. Schwindt C (1996). Generation of resource-constrained project scheduling problems with minimal and maximal time lags. Report WIOR-489, Institut für Wirtschafstheorie und Operations Research, Universität Karlsruhe.
57. De Reyck B and Herroelen W (1998). A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. Eur J Opl Res 111: 125-174.
58. Demeulemeester E, Elmaghraby SE and Herroelen WS (1996). Optimal procedures for the discrete time/cost trade-off problem in project networks. Eur J Opl Res 88: 50-68.
59. Demeulemeester E, De Reyck B, Foubert B, Herroelen W, and Vanhoucke M (1998). New computational results on the discrete time/cost trade-off problem in project networks. J Opl Res Soc 49: 1153-1163.
60. Demeulemeester E, De Reyck B and Herroelen W (1997). The discrete time/resource trade-off problem in project networks— A branch-and-bound approach. Research Report 9717, Department of Applied Economics, Katholieke Universiteit Leuven (Belgium).
61. De Reyck B, Demeulemeester E and Herroelen W (1998). Local search methods for the discrete time/resource trade-off problem in project networks. Nav Res Logist 45: 533-578.
62. Herroelen W, Demeulemeester E and Van Dommelen P (1996). An optimal recursive search procedure for the deterministic unconstrained max-npv project scheduling problem. Research Report 9603, Department of Applied Economics, Katholieke Universiteit Leuven (Belgium).
63. De Reyck B and Herroelen W (1998). An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations. Comp and Opns Res 25: 1-17.
64. Cooper DF (1976). Heuristics for scheduling resource- constrained projects: An experimental comparison. Mgmt Sci 22: 1186-1194.