Enhancing local search algorithms for job shops with min-sum objectives by approximate move evaluation
- 9 January 2013
- journal article
- Published by Springer Science and Business Media LLC in Journal of Scheduling
- Vol. 16 (5), 495-518
- https://doi.org/10.1007/s10951-012-0305-x
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problemComputers & Operations Research, 2011
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjectiveComputers & Operations Research, 2011
- A global constraint for total weighted completion time for unary resourcesConstraints, 2009
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problemComputers & Operations Research, 2008
- A very fast TS/SA algorithm for the job shop scheduling problemComputers & Operations Research, 2008
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problemComputers & Operations Research, 2006
- A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problemsInternational Journal of Systems Science, 2000
- An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithmInternational Journal of Systems Science, 1999
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990