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, New York 10314;Lehman Brothers Inc., New York City, USA NY 10019;Department of Mathematics, Computer Science & Statistics, Purdue University Calumet, Hammond IN 46323
Venue:
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Year:
2008

Citing 5
Cited 0

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

Quantified Score

Hi-index	0.00

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 very well by computational experiments.