A heuristic for minimizing the makespan in no-idle permutation flow shops

The paper deals with the problem of finding a job sequence that minimizes the makespan in m-machine flow shops under the no-idle condition. This condition requires that each machine must process jobs without any interruption from the start of processing the first job to the completion of processing...

Full description

Saved in:
Bibliographic Details
Published in:Computers & industrial engineering 2005-08, Vol.49 (1), p.146-154
Main Authors: Kalczynski, Pawel Jan, Kamburowski, Jerzy
Format: Article
Language:English
Subjects:
Flow shop
Heuristic
Heuristics
Job shops
Makespan
No-idle machines
Operations research
Production scheduling
Scheduling
Studies
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:The paper deals with the problem of finding a job sequence that minimizes the makespan in m-machine flow shops under the no-idle condition. This condition requires that each machine must process jobs without any interruption from the start of processing the first job to the completion of processing the last job. Since the problem is NP-hard, we propose a constructive heuristic for solving it that significantly outperforms heuristics known so far.
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2005.05.002