Abstract
The resource constrained project scheduling problem (RCPSP) can formulate many scheduling problems including jobshop and flowshop scheduling problems. In this paper, we extend the definition of RCPSP further so that various complicated constraints and objective functions arising in practice can be handled; for example, each activity can be processed in one of the selectable modes, the available amounts of renewable resources may vary depending on the periods, setup activities can be dealt with, and complex objective functions can be handled. Then, we develop a tabu search based heuristic algorithm, which contains elaborations in representing solutions and in constructing neighborhood. Our code was tested for many benchmarks of RCPSP, and also for some problems from real applications. For a number of RCPSP instances, we found better solutions than the best ones found so far. These computational results indicate the effectiveness and usefulness of our approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
T. Baar, P. Brucker, and S. Knust. Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problem. In: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I. Osman, and C. Roucairol, editors, Kluwer, VNIT pages 1–18, 1998.
C.E. Bell and J. Han. A New Heuristic Solution Method in Resource-Constrained Project Scheduling. Naval Research Logistics, 38:315–331, 1991.
J. Błazewicz, W. Domschke, and E. Pesch, The Job Shop Scheduling Problem: Conventional and New Solution Techniques. European Journal of Operational Research, 93:1–33, 1996.
P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch. Resource-Constrained Project Scheduling: Notation, Classification, Models, and Methods. European Journal of Operational Research, 112:3–41, 1999.
J-H. Cho and Y-D. Kim. A Simulated Annealing Algorithm for Resource Constrained Project Scheduling Problems. Journal of the Operational Research Society, 48:736–744, 1997.
F. Glover. Tabu Search — Part I. ORSA Journal on Computing, 1:190–206, 1989.
S. Hartmann. A Competitive Genetic Algorithm for Resource-Constrained Project Scheduling. Naval Research Logistics, 45:733–750, 1998.
S. Hartmannn. Self-Adapting Genetic Algorithms with an Application to Project Scheduling. Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel #506, 1999.
W. Herroelen, B. De Reyck, and E. Demeulemeester. Resource-Constrained Project Scheduling: A Survey of Recent Developments. Computers and Operations Research, 25:279–302, 1998.
R. Kolisch. Serial and Parallel Resource-Constrained Project Scheduling Methods Revisited: Theory and Computation. European Journal of Operational Research, 90:320–333, 1996.
R. Kolisch and A. Sprecher. PSPLIB — A Project Scheduling Library. European Journal of Operational Research, 96:205–216, 1997.
J-K. Lee and Y-D. Kim. Search Heuristics for Resource Constrained Project Scheduling. Journal of the Operational Research Society,47:678–689, 1996.
D. Merkle, M. Middendorf, and H. Schmeck. Ant Colony Optimization for Resource-Constrained Project Scheduling. In: Proceedings of the Genetic and Evolutionary Computation Conference, pages 893–900, 2000.
R.H. Möhring, A.S. Schulz, F. Stork, and M. Uetz. Solving Project Scheduling Problems by Minimum Cut Computations. Technical Report #680, Fachbereich Mathematik, Technische Universität, Berlin, 2000.
M. Mori and C.C. Tseng. A Genetic Algorithm for Multi-Mode Resource Constrained Project Scheduling Problem. European Journal of Operational Research, 100:134–141, 1997.
S. Morito, J. Imaizumi, and J.W. Park. A Mathematical Programming Approach to a Tightly Constrained Scheduling Problem (in Japanese). In: Proceedings of the 1996 Production Scheduling Symposium, pages 85–90, 1996.
K. Nonobe and T. Ibaraki. A Tabu Search Approach to the Constraint Satisfaction Problem as a General Problem Solver. European Journal of Operational Research, 106:599–623, 1998.
J.H. Patterson. A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem. Management Science, 30:854–867, 1984.
S.E. Sampson and E.N. Weiss. Local Search Techniques for Generalized Resource Constrained Project Scheduling Problem. Naval Research Logistics, 40:665–675, 1993.
A. Sprecher, R. Kolisch, and A. Drexl. Semi-Active, Active, Non-Delay Schedules for the Resource-Constrained Project Scheduling Problem. European Journal of Operational Research, 80:94–102, 1995.
P.R. Thomas and S. Salhi. A Tabu Search Approach for the Resource Constrained Project Scheduling Problem. Journal of Heuristics, 4:123–139, 1998.
M.G.A. Verhoeven. Tabu Search for Resource-Constrained Scheduling. European Journal of Operational Research, 106:266–276, 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Nonobe, K., Ibaraki, T. (2002). Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem. In: Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1507-4_25
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1507-4_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5588-5
Online ISBN: 978-1-4615-1507-4
eBook Packages: Springer Book Archive