When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

INFORMS Journal on Computing

Volumn 12, Issue 1, 2000, Pages 57-73

  Woeginger, Gerhard J ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Approximate algorithm; Dynamic programming; FPTAS; Worst case analysis

Indexed keywords

EID: 0007604993     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.12.1.57.11901     Document Type: Article

References (41)

1. G. AUSIELLO, P. CRESCENZI, and M. PROTASI, 1995. Approximate Solution of NP Optimization Problems, Theoretical Computer Science 150, 1-55.
2. G. AUSIELLO, A. D'ATRI, and M. PROTASI, 1980. Structure Preserving Reductions Among Convex Optimization Problems, Journal of Computer and Systems Sciences 21, 136-153.
3. G. AUSIELLO, A. MARCHETTI-SPACCAMELA, and M. PROTASI, 1980. Toward a Unified Approach for the Classification of NP Complete Optimization Problem, Theoretical Computer Science 12, 83-96.
4. R.E. BELLMAN and S.E. DREYFUS, 1962. Applied Dynamic Programming, Princeton University Press, Princeton.
5. S. BROWNE and U. YECHIALI, 1990. Scheduling Deteriorating Jobs on a Single Processor, Operations Research 38, 432-450.
6. P. BRUCKER and M.Y. KOVALYOV, 1996. Single Machine Batch Scheduling to Minimize the Weighted Number of Late Jobs, ZOR - Mathematical Methods of Operations Research 43, 1-8.
7. J.L. BRUNO, E.G. COFFMAN, JR., and R. SETHI, 1974. Scheduling Independent Tasks to Reduce Mean Finishing Time, Communications of the ACM 17, 382-387.
8. X. CAI, 1995. Minimization of Agreeably Weighted Variance in Single Machine Systems, European Journal of Operational Research 85, 576-592.
9. Z.-L. CHEN, 1996. Parallel Machine Scheduling with Time Dependent Processing Times, Discrete Applied Mathematics 70, 81-9.
10. S. EILON and I.G. CHOWDHURY, 1977. Minimizing Waiting Variance in the Single Machine Problem, Management Science 23, 567-575.
11. M. FLORIAN, J.K. LENSTRA, and A.H.G. RINNOOY KAN, 1980. Deterministic Production Planning: Algorithms and Complexity, Management Science 26, 669-679.
12. M.R. GAREY and D.S. JOHNSON, 1978. 'Strong' NP-Completeness Results: Motivation, Examples, and Implications, Journal of the ACM 25, 499-508.
13. M.R. GAREY and D.S. JOHNSON, 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.
14. G.V. GENS and E.V. LEVNER, 1981. Fast Approximation Algorithms for Job Sequencing with Deadlines, Discrete Applied Mathematics 3, 313-318.
15. R.L. GRAHAM, E.L. LAWLER, J.K. LENSTRA, and A.H.G. RINNOOY KAN, 1979. Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Annals of Discrete Mathematics 5, 287-326.
16. N.G. HALL and M.E. POSNER, 1991. Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times about a Common Due Date, Operations Research 39, 836-846.
17. A.M.A. HARIRI, C.N. POTTS, and L.N. VAN WASSENHOVE, 1995. Single Machine Scheduling to Minimize Total Weighted Late Work, ORSA Journal on Computing 7, 232-242.
18. D.S. HOCHBAUM and D. LANDY, 1994. Scheduling with Batching: Minimizing the Weighted Number of Tardy Jobs, Operations Research Letters 16, 79-86.
19. E. HOROWITZ and S. SAHNI, 1974. Computing Partitions with Applications to the Knapsack Problem. Journal of the ACM 21, 277-292.
20. E. HOROWITZ and S. SAHNI, 1976. Exact and Approximate Algorithms for Scheduling Nonidentical Processors, Journal of the ACM 23, 317-327.
21. O. IBARRA and C.E. KIM, 1975. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems, Journal of the ACM 22, 463-468.
22. B. JURISCH, W. KUBIAK, and J. JOZEFOWSKA, 1997. Algorithms for Minclique Scheduling Problems, Discrete Applied Mathematics 72, 115-139.
23. R.M. KARP, 1972. Reducibility Among Combinatorial Problems. In Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, eds. Plenum Press, New York, pp. 85-104.
24. M.Y. KOVALYOV and W. KUBIAK, 1998. A Fully Polynomial Time Approximation Scheme for the Weighted Earliness-Tardiness Problem, to appear in Operations Research.
25. M.Y. KOVALYOV and W. KUBIAK, 1998. A Fully Polynomial Time Approximation Scheme for Minimizing Makespan of Deteriorating Jobs, Journal of Heuristics 3, 287-297.
26. M.Y. KOVALYOV, C.N. POTTS, and L.N. VAN WASSENHOVE, 1994. A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work, Mathematics of Operations Research 19, 86-93.
27. W. KUBIAK, 1993. Completion Time Variance on a Single Machine Is Difficult, Operations Research Letters 14, 49-59.
28. W. KUBIAK and S.L. VAN DE VELDE, 1998. Scheduling Deteriorating Jobs to Minimize Makespan, to appear in Naval Research Logistics.
29. E.L. LAWLER, 1997. A 'Pseudopolynomial' Algorithm for Sequencing Jobs to Minimize Total Tardiness, Annals of Discrete Mathematics 1, 331-342.
30. E.L. LAWLER, 1979. Fast Approximation Schemes for Knapsack Problems, Mathematics of Operations Research 4, 339-356.
31. E.L. LAWLER, 1982. A Fully Polynomial Approximation Scheme for the Total Tardiness Problem, Operations Research Letters 1, 207-208.
32. E.L. LAWLER, J.K. LENSTRA, A.H.G. RINNOOY KAN, and D.B. SHMOYS, 1993. Sequencing and Scheduling: Algorithms and Complexity. In Logistics of Production and Inventory, S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin (eds.), Handbooks in Operations Research and Management Science 4, North-Holland, Amsterdam, pp. 445-522.
33. E.L. LAWLER and J.M. MOORE, 1969. A Functional Equation and its Application to Resource Allocation and Sequencing Problems, Management Science 16, 77-84.
34. J.K. LENSTRA, 1977. Unpublished manuscript.
35. J.K. LENSTRA, A.H.G. RINNOOY KAN, and P. BRUCKER, 1977. Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics 1, 343-362.
36. A. PAZ and S. MORAN, 1981. Non Deterministic Polynomial Optimization Problems and their Approximations, Theoretical Computer Science 15, 251-277.
37. C.N. POTTS and L.N. VAN WASSENHOVE, 1992. Single Machine Scheduling to Minimize Total Late Work, Operations Research 40, 586-595.
38. C.N. POTTS and L.N. VAN WASSENHOVE, 1992. Approximation Algorithms for Scheduling a Single Machine to minimize Total Late Work, Operations Research Letters 11, 261-266.
39. S. SAHNI, 1976. Algorithms for Scheduling Independent Tasks, Journal of the ACM 23, 116-127.
40. C.P.M. VAN HOESEL and A.P.M. WAGELMANS, 1997. Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems, Economic Institute Report 9735/A, Erasmus University, Rotterdam.
41. G.J. WOEGINGER, 1998. An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine, Technical Report Woe-21, TU Graz, Austria.