On metaheuristic "failure modes": a case study in Tabu search for job-shop scheduling.
Conference
·
OSTI ID:969844
In this paper, we analyze the relationship between pool maintenance schemes, long-term memory mechanisms, and search space structure, with the goal of placing metaheuristic design on a more concrete foundation.
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 969844
- Report Number(s):
- SAND2005-3360C; TRN: US201002%%826
- Resource Relation:
- Conference: Proposed for presentation at the Sixth Metaheuristics International Conference (MIC 2005) held August 22, 2005 in Vienna, Austria.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Deconstructing Nowicki and Smutnickis i-TSAB tabu search algorithm for the job-shop scheduling problem.
Minimizing total energy cost and tardiness penalty for a scheduling-layout problem in a flexible job shop system: A comparison of four metaheuristic algorithms
An analysis of iterated local search for job-shop scheduling.
Journal Article
·
Wed Jun 01 00:00:00 EDT 2005
· Proposed for publication in Computers and Operations Research.
·
OSTI ID:969844
Minimizing total energy cost and tardiness penalty for a scheduling-layout problem in a flexible job shop system: A comparison of four metaheuristic algorithms
Journal Article
·
Fri Jan 17 00:00:00 EST 2020
· Computers and Industrial Engineering
·
OSTI ID:969844
+1 more
An analysis of iterated local search for job-shop scheduling.
Conference
·
Fri Aug 01 00:00:00 EDT 2003
·
OSTI ID:969844