More on three-machine no-idle flow shops

Authors:
Jerzy Kamburowski
Affiliations:
Department of Information, Operations and Technology Management, College of Business Administration, The University of Toledo, Toledo, OH
Venue:
Computers and Industrial Engineering
Year:
2004

Citing 3
Cited 6

The analysis of activity networks under generalized precedence relations (GPRs)

Management Science
Three stage no-idle flow-shops

Computers and Industrial Engineering
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

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

Computers and Industrial Engineering
Three-machine flowshop with two operations per job to minimize makespan

Computers and Industrial Engineering
A heuristic for minimizing the makespan in no-idle permutation flow shops

Computers and Industrial Engineering
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 solving no-idle flowshops

SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
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.01

Visualization

Abstract

Recently in this journal Saadani, Guinet, and Moalla [Comput Ind Engng 44 (2003) 425] considered the NP-hard problem of minimizing the makespan in a three-machine no-idle flow shop. We identify a simple network representation of the makespan that provides a better insight into the problem, reveals a certain anomaly resulting from the no-idle condition, and leads to some dominance relations among the machines under which the problem becomes efficiently solvable. Extensions to m-machine no-idle flow shops are also included.