A polynomial approximation scheme for problem F2/ rj/ Cmax

We present a polynomial approximation scheme { ε } for the sytongly NP-hard problem of scheduling n jobs in a two-machine flow-shop subject to release dates. This scheme is based on a dynamic programming approach applied to a problem with rounded release dates and processing times. In comparison wit...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 20; no. 2; pp. 75 - 79
Main Authors Kovalyov, Mikhail Y., Werner, Frank
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 1997
Elsevier
Subjects
Applied sciences
Dynamic programming
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Polynomial approximation scheme
Scheduling
Scheduling, sequencing
Two-machine flow-shop
Scheduling
Dynamic programming
Two-machine flow-shop
Polynomial approximation scheme
Production system
Flow shop
Algorithms
Polynomial approximation
Online AccessGet full text
ISSN0167-6377
1872-7468
DOI10.1016/S0167-6377(96)00049-1

Cover

More Information
Summary:We present a polynomial approximation scheme { ε } for the sytongly NP-hard problem of scheduling n jobs in a two-machine flow-shop subject to release dates. This scheme is based on a dynamic programming approach applied to a problem with rounded release dates and processing times. In comparison with Hall's polynomial approximation scheme, our scheme has a better time complexity estimation for small ε and sufficiently large n.
ISSN:0167-6377
1872-7468
DOI:10.1016/S0167-6377(96)00049-1