Minimizing total completion time in two-machine flow shops with exact delays

Authors:
Yumei Huo;Haibing Li;Hairong Zhao
Affiliations:
Department of Computer Science, College of Staten Island, CUNY, 2800 Victory Boulevard, 1N-215, Staten Island, NY 10314, USA;Lehman Brothers Inc., New York City, NY 10019, USA;Department of Mathematics, Computer Science and Statistics, Purdue University Calumet, 2200 169th Street, Hammond, IN 46323, USA
Venue:
Computers and Operations Research
Year:
2009

Citing 5
Cited 4

Genetic algorithms applied to the continuous flow shop problem

Computers and Industrial Engineering
Flowshop scheduling with limited temporary storage

Journal of the ACM (JACM)
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling
Approximation algorithms for scheduling problems with exact delays

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Approximation algorithms for UET scheduling problems with exact delays

Operations Research Letters

Minimizing total completion time in two-machine flow shops with exact delay using genetic algorithm & ant colony algorithm

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
A two-machine flowshop problem with two agents

Computers and Operations Research
A hybrid scheduling decision support model for minimizing job tardiness in a make-to-order based mould manufacturing environment

Expert Systems with Applications: An International Journal
A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study the problem of minimizing total completion time in the two-machine flow shop with exact delay model. This problem is a generalization of the no-wait flow shop problem which is known to be strongly NP-hard. Our problem has many applications but little results are given in the literature so far. We focus on permutation schedules. We first prove that some simple algorithms can be used to find the optimal schedules for some special cases. Then for the general case, we design some heuristics as well as metaheuristics whose performance are shown to be effective by computational experiments.