An experimental analysis of local minima to improve neighbourhood search
- 31 December 2003
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 30 (14), 2157-2173
- https://doi.org/10.1016/s0305-0548(02)00128-4
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Two simulated annealing-based heuristics for the job shop scheduling problemEuropean Journal of Operational Research, 1999
- Deterministic job-shop scheduling: Past, present and futureEuropean Journal of Operational Research, 1999
- Some new results on simulated annealing applied to the job shop scheduling problemEuropean Journal of Operational Research, 1999
- On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop ProblemLecture Notes in Computer Science, 1998
- Job Shop Scheduling by Local SearchINFORMS Journal on Computing, 1996
- New Search Spaces for Sequencing Problems with Application to Job Shop SchedulingManagement Science, 1992
- Job Shop Scheduling by Simulated AnnealingOperations Research, 1992
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975