Sciweavers

FSTTCS
1999
Springer

A Randomized Algorithm for Flow Shop Scheduling

13 years 7 months ago
A Randomized Algorithm for Flow Shop Scheduling
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(m ln(m + n)pmax)/δ2 ).
Naveen Garg, Sachin Jain, Chaitanya Swamy
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where FSTTCS
Authors Naveen Garg, Sachin Jain, Chaitanya Swamy
Comments (0)