id: 05037967
dt: j
an: 05037967
au: Framinan, Jose M.; Schuster, Christoph
ti: An enhanced timetabling procedure for the no-wait job shop problem: a
    complete local search approach.
so: Comput. Oper. Res. 33, No. 5, 1200-1213 (2006).
py: 2006
pu: Elsevier Science Ltd. (Pergamon), Oxford
la: EN
cc: 
ut: 
ci: 
li: doi:10.1016/j.cor.2004.09.009
ab: Summary: 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.
rv: