Resource-constrained project scheduling by simulated annealing
- 1 August 1996
- journal article
- research article
- Published by Informa UK Limited in International Journal of Production Research
- Vol. 34 (8), 2335-2351
- https://doi.org/10.1080/00207549608905028
Abstract
This paper presents a new adaptation of the simulated annealing algorithm for solving non-preemptive resource-constrained project scheduling problems in which resources are limited but renewable from period to period. This algorithm is able to handle single-mode and multi-mode problems and to optimize different objective functions. Statistical experiments show the efficiency of the proposed algorithm even in comparison to some Tabu search heuristics.Keywords
This publication has 38 references indexed in Scilit:
- Heuristics for scheduling projects with resource restrictions and several resource-duration modesInternational Journal of Production Research, 1993
- An Optimization Based Heuristic for Scheduling Parallel Project Networks with Constrained Renewable ResourcesIIE Transactions, 1988
- Two Approaches to Problems of Resource Allocation Among Project Activities — A Comparative StudyJournal of the Operational Research Society, 1980
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]ACM Transactions on Mathematical Software, 1977
- Scheduling a Project Under Multiple Resource Constraints: A Zero-One Programming ApproachA I I E Transactions, 1976
- A Branch and Bound Algorithm for Use in Resource AllocationA I I E Transactions, 1976
- Alternate methods of project scheduling with limited resourcesNaval Research Logistics Quarterly, 1973
- Resource-constrained Project Scheduling — The State of the ArtJournal of the Operational Research Society, 1972
- On Resource Allocation in Project NetworksJournal of the Operational Research Society, 1972
- Resource allocation and multi-project scheduling (RAMPS)--a new tool in planning and controlThe Computer Journal, 1963