The no-wait flow-shop paradox

DOI10.1016/J.ORL.2004.10.007zbMath1082.90040OpenAlexW2016442706MaRDI QIDQ813966

Gerhard J. Woeginger, Frits C. R. Spieksma

Publication date: 2 February 2006

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.10.007

zbMATH Keywords

schedulingflow-shop problemresource paradox

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Windows scheduling of arbitrary-length jobs on multiple machines ⋮ A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness ⋮ A survey of scheduling problems with no-wait in process ⋮ Analysis of flow shop scheduling anomalies ⋮ No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem ⋮ Permutation, no-wait, no-idle flow shop problems ⋮ The evolution of schematic representations of flow shop scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• How bad is selfish routing?
• Über ein Paradoxon aus der Verkehrsplanung
• Bounds on Multiprocessing Timing Anomalies
• The transportation paradox
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
• The Transportation Problem and its Variants

This page was built for publication: The no-wait flow-shop paradox