Analysis of heuristics for the UET two-machine flow shop problem with time delays

Authors:
V. J. Rayward-Smith;D. Rebaine
Affiliations:
School of Computing Sciences, University of East Anglia, Norwich NR4 7TJ, UK;Département d'Informatique et de Mathématique, Université du Québec í Chicoutimi, Qué., Canada G7H 2B1
Venue:
Computers and Operations Research
Year:
2008

Citing 4
Cited 1

Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling
Flow shop vs. permutation shop with time delays

Computers and Industrial Engineering
Polynomial time algorithms for the UET permutation flowshop problem with time delays

Computers and Operations Research
Permutation vs. non-permutation flow shop schedules

Operations Research Letters

On-line two-machine job shop scheduling with time lags

Information Processing Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

The problem of minimising the overall completion time for the two-machine flow shop problem with unit execution time (UET) tasks and arbitrary time delays is known to be unary NP-hard. Two heuristic algorithms to solve this problem along with their worst-case analyses are presented. We also discuss computational experiments we conducted to study the average-case performance of these two heuristics using simulation and statistical sampling methods.