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

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2008-10, Vol.35 (10), p.3298-3310
Hauptverfasser:	Rayward-Smith, V.J., Rebaine, D.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Exact sciences and technology Flow shop Heuristic Job shops Operational research and scientific management Operational research. Management science Sampling Schedule length Scheduling, sequencing Simulation Studies Time delays Worst- and average-case analysis
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0305-0548 1873-765X 0305-0548
DOI:	10.1016/j.cor.2007.02.015