We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used lower bound on the optimal makespan. We also obtain a nearly tight hardness result for the general version of flow shops, where jobs are not required to be processed on each machine. Similar results hold true when the objective is to minimize the sum of completion times. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Mastrolilli, M., & Svensson, O. (2009). Improved bounds for flow shop scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5555 LNCS, pp. 677–688). https://doi.org/10.1007/978-3-642-02927-1_56
Mendeley helps you to discover research relevant for your work.