Abstract
The Resource-Constrained Project Scheduling (RCPS) problem is a well known and challenging combinatorial optimization problem. It is a generalization of the Job Shop Scheduling problem and thus is NP-hard in the strong sense. Problem Space Search is a local search "metaheuristic" which has been shown to be effective for a variety of combinatorial optimization problems including Job Shop Scheduling. In this paper, we propose two problem space search heuristics for the RCPS problem. These heuristics are tested through intensive computational experiments on a 480-instance RCPS data set recently generated by Kolisch et al. [12]. Using this data set we compare our heuristics with a branch-and-bound algorithm developed by Demuelemeester and Herreolen [9]. The results produced by the heuristics are extremely encouraging, showing comparable performance to the branch-and-bound algorithm.
Similar content being viewed by others
References
R. Alvarez-Valdéz and J.M. Tamarit, Heuristic algorithms for resource-constrained project scheduling: A review and empirical analysis, in: Advances in Project Scheduling, R. Slowiński and J. Weglarz, eds., Elsevier Science, Amsterdam, 1989, pp. 113–134.
K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
M. Bartusch, R.H. Möhring and F.J. Radermacher, Scheduling project networks with resource constraints and time windows, Annals of Operations Research 16(1988)201–240.
C.E. Bell and J. Han, A new heuristic solution method in resource constrained project scheduling, Naval Research Logistics 38(1991)315–331.
J. Blazewicz, J.K. Lenstra and A.H.G. Rinnooy Kan, Scheduling subject to resource constraints: Classification and complexity, Discrete Applied Mathematics 5(1983)11–24.
E.W. Davis and J.H. Patterson, A comparison of heuristic and optimum solutions in resource constrained project scheduling, Management Science 21(1975)944–955.
R.F. Deckro, E.P. Winkofsky, J.E. Herbert and R. Gangon, Decomposition approach to multi-project scheduling, Eur. J. of Oper. Res. 51(1991)110–118.
A. Drexl, Scheduling of project networks by job assignment, Management Science 37(1991)63–76.
E. Demuelemeester and W. Herreolen, A branch-and-bound procedure for the multiple resource constrained project scheduling problem, Management Science 38(1992)1803–1818.
C. Fowler and R.H. Storer, A problem space genetic algorithm for flow shop scheduling with due dates, Working Paper No. 94W-001, Department of Industrial and Manufacturing Systems Engineering, Lehigh University, Bethlehem, PA, 1994.
S. Kim and R.C. Leachman, Multi-project scheduling with explicit lateness costs, IIE Transactions 25(1993)34.
R. Kolisch, A. Sprecher and A. Drexl, Characterization and generation of a general class of resource constrained project scheduling problems: Easy and hard instances, Nr. 301, Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, Olhausenstr., Kiel, Germany, December 1992.
I.S. Kurtulus and S.C. Narula, Multiproject scheduling: Analysis of project performance, IIE Transactions 28(1985)58–66.
O. Osman and B. Hasan, Comparative study of computational procedures for the resource constrained project scheduling problem, Eur. J. of Oper. Res. 72(1994)406–416.
C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
J.H. Patterson, A comparison of exact approaches for solving the multiple constrained resource project scheduling problem, Management Science 30(1984)854–867.
J.H. Patterson, R. Slowinski, B. Talbot and J. Weglarz, Computational experience with a backtracking algorithm for solving a general class of precedence and resource constrained scheduling problems, Eur. J. of Oper. Res. 49(1990)68–79.
I. Park, Problem space search for sequencing type problems, unpublished Ph.D. Dissertation, Department of Industrial and Manufacturing Systems Engineering, Lehigh University, 1994.
S.E. Sampson and E.N. Weiss, Local search techniques for the generalized resource constrained project scheduling problem, Naval Research Logistics 40(1993)665–676.
R. Slowinski, Two approaches to the problem of resource allocation among project activities — a comparative study, J. of the Oper. Res. Soc 31(1980)711–723.
R. Slowinski, Multi-objective network scheduling with efficient use of renewable and non-renewable resources, Eur. J. of Oper. Res. 7(1981)265–273.
R.H. Storer, S.D. Wu and R. Vaccari, New search spaces for sequencing problems with application to job shop scheduling, Management Science 38(1992)1495–1509.
R.H. Storer, S.W. Flanders and S.D. Wu, Problem space local search for number partitioning, Annals of Operations Research 63(1996)465–487.
E.B. Talbot, Project scheduling with resource-duration interactions: The non-preemptive case, Management Science 28(1982)1197–1210.
J.D. Weist and F.K. Levy, A Management Guide to PERT/CPM, 2nd ed., Prentice-Hall, Englewood Cliffs, NJ, 1977.
K.K. Yang, F.B. Talbot and J.H. Patterson, Scheduling a project to maximize its net present value: An integer programming approach, Eur. J. of Oper. Res. 64(1992)188–198.
Y. Zong, T. Yang and J.P. Ignizio, Expert system using an exchange heuristic for resource constrained project scheduling, Expert Systems with Applications 6(1993)327–348.
Rights and permissions
About this article
Cite this article
Naphade, K.S., David Wu, S. & Storer, R.H. Problem space search algorithms for resource-constrained project scheduling. Annals of Operations Research 70, 307–326 (1997). https://doi.org/10.1023/A:1018982423325
Issue Date:
DOI: https://doi.org/10.1023/A:1018982423325