Abstract
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-constrained project scheduling problem (RCPSP).
We perform an experimental analysis to tune the parameters of our algorithm and to compare it with a tabu search based on a combination of neighborhood relations borrowed from the literature. Finally, we show that our algorithm is also competitive with the ones reported in the literature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baar, T., Brucker, P., Knust, S.: Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 1–18. Kluwer Academic Publishers, Dordrecht (1998)
Blazewicz, J., Lenstra, J., Kan, A.R.: Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics 5, 11–24 (1983)
Brest, J., Žerovnik, J.: An approximation algorithm for the asymmetric traveling salesman problem. Ricerca Operativa 28, 59–67 (1999)
Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112(1), 3–41 (1999)
Brucker, P., Knust, S., Schoo, A., Thiele, O.: A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research 107(2), 272–288 (1998)
Christian, A., Michelon, P., Reusser, S.: Insertion techniques for static and dynamic resource-constrained project scheduling. European Journal of Operational Research 149, 249–267 (2003)
Di Gaspero, L., Schaerf, A.: EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software—Practice and Experience 33(8), 733–765 (2003)
Gendreau, M., Hertz, A., Laporte, G., Stan, M.: A generalized insertion heuristic for the traveling salesman problem with time windows. Operations Research 46(3), 330–335 (1998)
Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Dordrecht (1997)
Hartmann, S., Kolisch, R.: Experimental evaulation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research 127(2), 394–407 (2000)
Hoos, H.H., Stützle, T.: Stochastic Local Search Foundations and Applications. Morgan Kaufmann Publishers, San Francisco, CA (USA) (2005)
Kolisch, R., Hartmann, S.: Heuristic algorithms for solving the resource-constrained project scheduling problem - classification and computational analysis. In: Weglarz, J. (ed.) Handbook on recent advances in project scheduling, pp. 147–178. Kluwer Academic Publishers, Dordrecht (1999)
Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research 174(1), 23–37 (2006)
Kolisch, R., Sprecher, A.: PSPLIB – a project scheduling library. European Journal of Operational Research 96(1), 205–216 (1997) Data available from http://129.187.106.231/psplib/
Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Management Science 44(5), 714–729 (1998)
Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58, 161–205 (1992)
Özdamar, L., Ulusoy, G.: A survey on the resource-constrained project scheduling problem. IIE transactions 27(5), 574–586 (1995)
Palpant, M., Artigues, C., Michelon, P.: Lssper: Solving the resource-constrained project scheduling problem with large neighbourhood search. Annals of Operations Research 131(1-4), 237–257 (2004)
Pesek, I., Žerovnik, J.: Best insertion algorithm for resource-constrained project scheduling problem (preprint, 2006) available on http://arxiv.org/abs/0705.2137v1
R Development Core Team. R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria (2005), ISBN 3-900051-07-0.
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254–265 (1987)
Valls, V., Quintanilla, S., Ballestín, F.: Resource-constrained project scheduling: A critical activity reordering heuristic. European Journal of Operational Research 149, 282–301 (2003)
Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics Bulletin 1, 80–83 (1945)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pesek, I., Schaerf, A., Žerovnik, J. (2007). Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem. In: Bartz-Beielstein, T., et al. Hybrid Metaheuristics. HM 2007. Lecture Notes in Computer Science, vol 4771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75514-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-75514-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75513-5
Online ISBN: 978-3-540-75514-2
eBook Packages: Computer ScienceComputer Science (R0)