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

Authors:
Pawel Jan Kalczynski;Jerzy Kamburowski
Affiliations:
Department of Information Operations and Technology Management, College of Business Administration, MS#103, The University of Toledo, Toledo, OH 43606-3390, USA;Department of Information Operations and Technology Management, College of Business Administration, MS#103, The University of Toledo, Toledo, OH 43606-3390, USA
Venue:
Computers and Industrial Engineering
Year:
2005

Citing 4
Cited 2

Three stage no-idle flow-shops

Computers and Industrial Engineering
More on three-machine no-idle flow shops

Computers and Industrial Engineering
Some local search algorithms for no-wait flow-shop problem with makespan criterion

Computers and Operations Research
A computational study of the permutation flow shop problem based on a tight lower bound

Computers and Operations Research

A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion

Computers and Operations Research
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.