A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations

European Journal of Operational Research

Volumn 111, Issue 1, 1998, Pages 152-174

  De Reyck, Bert ^a   Herroelen, Willy ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Branch and bound; Critical path methods; Generalized precedence relations; Project management

Indexed keywords

ALGORITHMS; CRITICAL PATH ANALYSIS; PROBLEM SOLVING; RESOURCE ALLOCATION; TREES (MATHEMATICS);

RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM (RCPSP);

SCHEDULING;

EID: 0032210246     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00305-6     Document Type: Article

References (41)

1. Bartusch, M., Möhring, R.H., Radermacher, F.J., 1988. Scheduling project networks with resource constraints and time windows. Ann. Oper. Res, 16, 201-240.
2. Brinkmann, K., Neumann, K., 1996. Heuristic procedures for resource-constrained project scheduling with minimal and maximal time lags: The minimum project-duration and resource-levelling problem. J. Dec. Syst. 5, 129-156.
3. Crandall, K.C., 1973. Project planning with precedence lead/lag factors. Proj. Mgmt. Quart. 4, 18-27.
4. Demeulemeester, E., Herroelen, W., 1992. A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Sci. 38, 1803-1818.
5. Demeulemeester, E., Herroelen, W., 1996. A branch-and-bound procedure for the preemptive resource-constrained project scheduling problem. Eur. J. Oper. Res. 90, 334-348.
6. Demeulemeester, E., Herroelen, W., 1997a. New benchmark results for the resource-constrained project scheduling problem. Management Sci. 43 (to appear).
7. Demeulemeester, E., Herroelen, W., 1997b. A branch-and-bound procedure for the generalized resource-constrained project scheduling problem. Oper. Res. 45, 201-212.
8. De Reyck, B., 1995. Project scheduling under generalized precedence relations - a review: Parts 1 and 2. Research Reports 9517 and 9518, Department of Applied Economics, Katholieke Universiteit Leuven.
9. De Reyck, B., Herroelen, W., 1996a. A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. Research Report 9613, Department of Applied Economics, Katholieke Universiteit Leuven.
10. De Reyck, B., Herroelen, W., 1996b. Computational experience with a branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. Research Report 9628, Department of Applied Economics, Katholieke Universiteit Leuven.
11. Elmaghraby, S.E., 1977. Activity Networks: Project Planning and Control by Network Models. Wiley, New York.
12. Elmaghraby, S.E., Herroelen, W., 1990. The scheduling of activities to maximize the net present value of projects. Eur. J. Oper. Res. 49, 35-49.
13. Elmaghraby, S.E., Kamburowski, J., 1992. The analysis of activity networks under generalized precedence relations. Management Sci. 38, 1245-1263.
14. Franck, B., Neumann, K., 1996. Priority-rule methods for the resource-constrained project scheduling problem with minimal and maximal time lags - an emprical analysis. In: Fifth International Workshop on Project Management and Scheduling. 11-13 April, Poznan, pp. 88-91.
15. Grinold, R.C., 1972. The payment scheduling problem. Naval Res. Logist. Quart. 19, 123-136.
16. Herroelen, W., Gallens, E., 1993. Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects. Eur. J. Oper. Res. 65, 274-277.
17. Herroelen, W., Demeulemeester, E., Van Dommelen, P., 1997. Project network models with discounted cash flows: A guided tour through recent developments. Eur. J. Oper. Res. 100, 97-121.
18. Herroelen, W., Demeulemeester, E., 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.
19. Icmeli, O., Erengüç, S.S., 1996. A branch-and-bound procedure for the resource-constrained project scheduling problem with discounted cash flows. Management Sci. 42, 1395-1408.
20. Kelley Jr., J.E., Walker, M.R., 1959. Critical path planning and scheduling. Eastern Joint Computing Conference 16, 160-172.
21. Kerbosh, J.A.G.M., Schell, H.J., 1975. Network planning by the Extended METRA Potential Method. Report KS-1.1, University of Technology Eindhoven, Department of Industrial Engineering.
22. Kolisch, R., Sprecher, A., Drexl, A., 1995. Characterization and generation of a general class of resource-constrained project scheduling problems. Management Sci. 41, 1693-1703.
23. Lawler, E.L., 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart & Winston, New York.
24. Malcolm, D.G., Roseboom, J.H., Clark, C.E., Fazar, W., 1959. Applications of a technique for R&D program evaluation (PERT). Oper. Res. 7, 646-669.
25. Mastor, A.A., 1970. An experimental and comparative evaluation of production line balancing techniques. Management Sci. 16, 728-746.
26. Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L., 1997. An exact algorithm for project scheduling with resource constraints based on a new mathematical programming formulation. Management Sci. (to appear).
27. Moder, J.J., Phillips, C.R., Davis, E.W., 1983. Project Management with CPM, PERT and Precedence Diagramming, 3rd ed. Van Nostrand Reinhold, New York.
28. Möhring, R.H., 1996 (private communication).
29. Neumann, K., Schwindt, C., 1997. Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production. OR Spektrum 19, 205-217.
30. Neumann, K., Zhan, J., 1995. Heuristics for the minimum project-duration problem with minimal and maximal time lags under fixed resource constraints. J. Intell. Manuf. 6, 145-154.
31. Pascoe, T.L., 1966. Allocation of resources - CPM. Revue Française de Recherche Opérationelle 38, 31-38.
32. Patterson, J.H., 1984. A comparison of exact procedures for solving the multiple resource-constrained project scheduling problem. Management Sci. 30, 854-867.
33. Roy, B., 1962. Graphes et ordonnancement. Revue Française de Recherche Opérationelle, 323-333.
34. Russell, A.H., 1970. Cash flows in networks. Management Sci. 16, 357-373.
35. Schwindt, C., 1996a. Generation of resource-constrained project scheduling problems with minimal and maximal time lags. Technical Report WIOR-489, Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe.
36. Schwindt, C., 1996b (private communication).
37. Schwindt, C., Neumann, K., 1996. A new branch-and-bound-based heuristic for resource-constrained project scheduling with minimal and maximal time lags. In: Fifth International Workshop on Project Management and Scheduling, 11-13 April, Poznan, pp. 212-215.
38. Stinson, J.P., Davis, E.W., Khumawala, B.M., 1978. Multiple resource-constrained scheduling using branch-and-bound. AIIE Transactions 10, 252-259.
39. Wiest, J.D., 1981. Precedence diagramming methods: Some unusual characteristics and their implications for project managers. J. Oper. Mgmt. 1, 121-130.
40. Wikum, E.D., Donna, C.L., Nemhauser, G.L., 1994. One-machine generalized precedence constrained scheduling problems. Oper. Res. Lett. 16, 87-99.
41. Zhan, J., 1994. Heuristics for scheduling resource-constrained projects in MPM networks. Eur. J. Oper. Res. 76, 192-205.