A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem.
Conference
·
OSTI ID:1146052
Abstract not provided.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1146052
- Report Number(s):
- SAND2007-8127C; 519773
- Resource Relation:
- Conference: Proposed for presentation at the CPAIOR 2008 held May 20-23, 2008 in Paris, France.
- Country of Publication:
- United States
- Language:
- English
Similar Records
An analysis of iterated local search for job-shop scheduling.
Deconstructing Nowicki and Smutnickis i-TSAB tabu search algorithm for the job-shop scheduling problem.
On metaheuristic "failure modes": a case study in Tabu search for job-shop scheduling.
Conference
·
Fri Aug 01 00:00:00 EDT 2003
·
OSTI ID:1146052
Deconstructing Nowicki and Smutnicki
Journal Article
·
Wed Jun 01 00:00:00 EDT 2005
· Proposed for publication in Computers and Operations Research.
·
OSTI ID:1146052
On metaheuristic "failure modes": a case study in Tabu search for job-shop scheduling.
Conference
·
Wed Jun 01 00:00:00 EDT 2005
·
OSTI ID:1146052