A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods

Authors:
Burak Ekşioğlu;Sandra Duni Ekşioğlu;Pramod Jain
Affiliations:
Department of Industrial and Systems Engineering, Mississippi State University, P.O. Box 9542, Mississippi State, MS 39762, USA;Department of Industrial and Systems Engineering, Mississippi State University, P.O. Box 9542, Mississippi State, MS 39762, USA;Sabre Airline Solutions, 3150 Sabre Drive, Southlake, TX 76092, USA
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 4
Cited 2

A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
An ant colony system for permutation flow-shop sequencing

Computers and Operations Research
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion

Computers and Operations Research
A neuro-tabu search heuristic for the flow shop scheduling problem

Computers and Operations Research

A new ant colony algorithm for makespan minimization in permutation flow shops

Computers and Industrial Engineering
Effect of solution representations on Tabu search in scheduling applications

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flowshop scheduling deals with the sequencing of a set of jobs that visit a set of machines in the same order. A tabu search procedure is proposed for the flowshop scheduling problem with the makespan minimization criterion. Different from other tabu search procedures, the neighborhood of a solution is generated using a combination of three different exchange mechanisms. This has resulted in a well-diversified search procedure. The performance of the algorithm is tested using Taillard's benchmark problems. The results are compared to recently developed neuro-tabu search and ant colony heuristics. The computational results indicate the effectiveness of the proposed approach.