Time complexity and linear-time approximation of the ancient two-machine flow shop

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-1425(1998100)1:3<149::AID-JOS10>3.0.CO;2-4" /><149::AID-JOS10>3.0.CO;2-4 10.1002/(SICI)1099-1425(1998100)1:3<149::AID-JOS10>3.0.CO;2-4zbMath0909.90180OpenAlexW2145999379MaRDI QIDQ1268836

Günter Rote, Gerhard J. Woeginger

Publication date: 1 November 1998

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(1998100)1:3<149::aid-jos10>3.0.co;2-4

zbMATH Keywords

computational complexityflow shoplower boundsmakespan minimizationapproximation algorithmstwo-machine flow shopalgebraic computation treeno wait in progress

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

On Eulerian extensions and their application to no-wait flowshop scheduling

This page was built for publication: Time complexity and linear-time approximation of the ancient two-machine flow shop