The no-wait flow-shop paradox

Authors:
Frits C. R. Spieksma;Gerhard J. Woeginger
Affiliations:
Department of Applied Economics, Katholieke Universiteit Leuven, Naamsestraat 69, B-3000 Leuven, Belgium;Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Operations Research Letters
Year:
2005

Citing 2
Cited 2

An anomaly in space-time characteristics of certain programs running in a paging machine

Communications of the ACM
How bad is selfish routing?

Journal of the ACM (JACM)

Windows scheduling of arbitrary-length jobs on multiple machines

Journal of Scheduling
No-Wait flowshop scheduling is as hard as asymmetric traveling salesman problem

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss a new resource paradox in the area of scheduling: Increasing the speed of some machines in a no-wait flow-shop instance may actually worsen the optimal makespan. We construct instances for which the ratio between optimal makespan with improved speed and optimal makespan without improved speed becomes arbitrarily bad.