| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 474294 | Computers & Operations Research | 2006 | 14 Pages |
Abstract
In this paper we consider the no-wait job shop problem with a makespan objective. This problem has usually been addressed by its decomposition into a sequencing and a timetabling problem. Here, first we focus on the timetabling problem and take advantage of the symmetry of the problem in order to suggest a new timetabling procedure. Secondly, we suggest embedding this timetabling into a recent metaheuristic named complete local search with memory.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jose M. Framinan, Christoph Schuster,