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

Authors:
Jose M. Framinan;Christoph Schuster
Affiliations:
Escuela Superior de Ingenieros, Camino de los Descubrimientos, Seville, Spain and Industrial Management, School of Engineering, University of Seville, Seville, Spain;Bayer Technology Services, Supply Chain Optimization, Leverkusen, Germany
Venue:
Computers and Operations Research
Year:
2006

Citing 9
Cited 3

New search spaces for sequencing problems with application to job shop scheduling

Management Science
A branch and bound algorithm for the job-shop scheduling problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
A fast taboo search algorithm for the job shop problem

Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
An effective hybrid optimization strategy for job-shop scheduling problems

Computers and Operations Research
Complete Local Search with Memory

Journal of Heuristics
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation

Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
Approximative procedures for no-wait job shop scheduling

Operations Research Letters

An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops

Computers and Operations Research
A proposal for a hybrid meta-strategy for combinatorial optimization problems

Journal of Heuristics
A fast hybrid tabu search algorithm for the no-wait job shop problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

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.