๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints

โœ Scribed by Hatem Hadda

Book ID
113085769
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
242 KB
Volume
6
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A polynomial time approximation scheme f
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
โœ Petra Schuurman; Gerhard J. Woeginger ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 148 KB

In this paper we investigate the two-stage multiprocessor ow shop scheduling problem F2(P)| โ€ข |Cmax, where the numbers m1 and m2 of machines available in the two stages are part of the input. We demonstrate the existence of a polynomial time approximation scheme for this problem. This result solves