论文信息 - A polynomial approximation scheme for problem F2/rj/Cmax

A polynomial approximation scheme for problem F2/rj/Cmax

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.

Mikhail Y. Kovalyov | Frank Werner

[1] Michael H. Rothkopf,et al. Scheduling Independent Tasks on Parallel Processors , 1966 .

[2] C. N. Potts. Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates , 1985, Math. Oper. Res..

[3] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[4] David B. Shmoys,et al. Near-Optimal Sequencing with Precedence Constraints , 1990, IPCO.

[5] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[6] Sartaj Sahni,et al. General Techniques for Combinatorial Approximation , 1977, Oper. Res..

[7] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .

[8] David B. Shmoys,et al. Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better , 1992, Math. Oper. Res..

[9] Leslie A. Hall,et al. A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem , 1994, Math. Oper. Res..

[10] David B. Shmoys,et al. Approximation schemes for constrained scheduling problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .

[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .