Simulated annealing for resource-constrained scheduling

We describe an application of several procedures to a resource-constrained scheduling problem. Basic and augmented neighborhood search procedures are first developed, using a unique way to generate neighborhoods. We then present a simulated annealing procedure which can be viewed as an evolution of...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1993-10, Vol.70 (1), p.43-51
Main Authors: Jeffcoat, David E., Bulfin, Robert L.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Heuristic
Heuristics
Mathematical models
Neighborhoods
Operational research and scientific management
Operational research. Management science
Operations research
Production scheduling
Resource-constrained scheduling
Scheduling, sequencing
Simulated annealing
Simulation
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We describe an application of several procedures to a resource-constrained scheduling problem. Basic and augmented neighborhood search procedures are first developed, using a unique way to generate neighborhoods. We then present a simulated annealing procedure which can be viewed as an evolution of the neighborhood search procedures. Computational results indicate that the procedures grow in power as they evolve, with the simulated annealing procedure providing the best results, and further, that it is a viable approach for a very difficult scheduling problem.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(93)90231-B