A Randomized Algorithm for Flow Shop Scheduling

Authors:
Naveen Garg;Sachin Jain;Chaitanya Swamy
Affiliations:
-;-;-
Venue:
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
1999

Citing 6
Cited 0

Improved Approximation Algorithms for Shop Scheduling Problems

SIAM Journal on Computing
Cut problems and their application to divide-and-conquer

Approximation algorithms for NP-hard problems
Makespan minimization in job shops: a polynomial time approximation scheme

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Chernoff-Hoeffding bounds for applications with limited independence

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Better approximation guarantees for job-shop scheduling

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximability of flow shop scheduling

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.03

Visualization

Abstract

Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop scheduling where the number of machines is part of the input problem. Our algorithm has a multiplicative factor of 2(1 + δ) and an additive term of O(mln(m+ n)pmax)/δ2).