Improved Bounds for Flow Shop Scheduling

Authors:
Monaldo Mastrolilli;Ola Svensson
Affiliations:
IDSIA, Switzerland;IDSIA, Switzerland
Venue:
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Year:
2009

Citing 7
Cited 0

Improved Approximation Algorithms for Shop Scheduling Problems

SIAM Journal on Computing
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Better Approximation Guarantees for Job-Shop Scheduling

SIAM Journal on Discrete Mathematics
Non-Approximability Results for Scheduling Problems with Minsum Criteria

INFORMS Journal on Computing
Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
(Acyclic) Job Shops are Hard to Approximate

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Tight bounds for permutation flow shop scheduling

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.