Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problem
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 1-18
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A branch and bound algorithm for the resource-constrained project scheduling problemEuropean Journal of Operational Research, 1998
- A simulated annealing algorithm for resource constrained project scheduling problemsJournal of the Operational Research Society, 1997
- Resource-constrained project scheduling by simulated annealingInternational Journal of Production Research, 1996
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computationEuropean Journal of Operational Research, 1996
- Adaptive search for solving hard project scheduling problemsNaval Research Logistics (NRL), 1996
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling ProblemsManagement Science, 1995
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling ProblemManagement Science, 1992
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961