Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
