An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach

An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach

0.00 Avg rating0 Votes
Article ID: iaor20071726
Country: United Kingdom
Volume: 33
Issue: 5
Start Page Number: 1200
End Page Number: 1213
Publication Date: May 2006
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.