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). © Springer-Verlag Berlin Heidelberg 1999.
Cite
CITATION STYLE
Garg, N., Jain, S., & Swamy, C. (1999). A randomized algorithm for flow shop scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1738, pp. 213–218). Springer Verlag. https://doi.org/10.1007/3-540-46691-6_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
