A fast tabu search algorithm for the permutation flow-shop problem

A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in the permutation flow shop is presented. The algorithm is based on a tabu search technique with a specific neighborhood definition which employs a block of jobs notion. Computational experiments (...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1996-05, Vol.91 (1), p.160-175
Main Authors: Nowicki, Eugeniusz, Smutnicki, Czesław
Format: Article
Language:English
Subjects:
Algorithms
Flow-shop scheduling
Heuristic
Heuristics
Job shops
Production scheduling
Studies
Tabu search
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in the permutation flow shop is presented. The algorithm is based on a tabu search technique with a specific neighborhood definition which employs a block of jobs notion. Computational experiments (up to 500 jobs and 20 machines) show its excellent numerical properties.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(95)00037-2