A polynomial approximation scheme for problem F2/rj/Cmax

Authors:
Mikhail Y. Kovalyov;Frank Werner
Affiliations:
Institute of Engineering Cybernetics, Belarus Academy of Sciences, Suganova 6, 220012 Minsk, Belarus Germany;Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik, PSF 4120, Magdeburg, Germany
Venue:
Operations Research Letters
Year:
1997

Citing 5
Cited 4

Jackson's rule for single-machine scheduling: making a good heuristic better

Mathematics of Operations Research
A polynomial approximation scheme for a constrained flow-shop scheduling problem

Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Near-Optimal Sequencing with Precedence Constraints

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
Approximation schemes for constrained scheduling problems

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times

Theoretical Computer Science
Polynomial-time approximation schemes for scheduling problems with time lags

Journal of Scheduling
An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a polynomial approximation scheme {"@e} 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 @e and sufficiently large n.