Back to Search
Start Over
Optimization of resource‐constrained project schedules by simulated annealing and variable neighborhood search
- Source :
- Technological and Economic Development of Economy; January 2006, Vol. 12 Issue: 4 p307-313, 7p
- Publication Year :
- 2006
-
Abstract
- AbstractApplications of information technologies are often related to making some schedules, timetables of tasks or jobs with constrained resources. In this paper we consider job scheduling and optimization algorithms related to resources, time and other constraints. Schedule optimization procedures, based on schedule coding by priority list of jobs, are created and investigated. Optimal priority list of jobs is found by approaching algorithms of local and global search, namely, random search and simulated annealing methods with the variable neighborhood, defined by the decoding procedure applied. Computational results with testing data from project scheduling Library are given.
Details
- Language :
- English
- ISSN :
- 20294913 and 20294921
- Volume :
- 12
- Issue :
- 4
- Database :
- Supplemental Index
- Journal :
- Technological and Economic Development of Economy
- Publication Type :
- Periodical
- Accession number :
- ejs23670497
- Full Text :
- https://doi.org/10.1080/13928619.2006.9637759