Competitive algorithms for multistage online scheduling

•We study online flow shop scheduling where jobs must be processed in several stages.•We show that a restricted version of the offline version of the problem is APX-hard.•We provide online algorithms and lower bounds for different variants of the problem. We study an online flow shop scheduling prob...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 260; no. 2; pp. 468 - 481
Main Authors:	Hopf, Michael, Thielen, Clemens, Wendt, Oliver
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.07.2017
Subjects:	Competitive analysis Online optimization Scheduling Online optimization Competitive analysis Scheduling
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!