Improved randomized approximation algorithms for lot-sizing problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 359-373

  Teo, Chung Piaw ^a   Bertsimas, Dimitris ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947940476     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_27     Document Type: Conference Paper

References (21)

1. D. Atkins, M. Queyranne and D. Sun. Lot sizing policies for finite production rate assembly systems, Operations Research, 40, 126-141, 1992.
2. D. Bertsimas, C. Teo and R. Vohra. Nonlinear relaxations and improved randomized approximation algorithms for multicut problems, Proc. 4th IPCO Conference, 29-39, 1995.
3. D. Bertsimas and R. Vohra. Linear programming relaxations, approximation algorithms and randomization: a unified view of covering problems, Preprint 1994.
4. G. Dobson. The Economic Lot-Scheduling Problem: Achieving Feasibility using Time-Varying Lot Sizes, Operations Research, 35, 764-771, 1987.
5. A. Federgruen, M. Queyranne and Y.S. Zheng. Simple power-of-two policies are close to optimal in a genera class of production/distribution system with general joint setup costs, Mathematics of Operations Research, 17, 4, 1992.
6. A. Federgruen and Y.S. Zheng. Optimal power-of-two replenishment strategies in capacitated general production/distribution networks, Management Science, 39, 6, 710-727, 1993.
7. M.X. Goemans and David Williamson. A new 3/4 approximation algorithm for MAX SAT, Proc. 3rd IPGO Conference, 313-321, 1993.
8. M.X. Goemans and David Williamson. 878 approximation algorithms for MAX-CUT and MAX 2SAT, Proc. 26th Annual ACM STOC, 422-431, 1994.
9. D. Hochbaum and G. Shanthikumar. Convex separable optimization is not much harder than linear optimization, Journal of ACM, 37, 843-861, 1990.
10. P. Jackson, W. Maxwell and J. Muckstadt. The joint replenishment problem with power-of-two restriction. AI IE Trans., 17, 25-32, 1985.
11. P. Jackson and R. Roundy. Minimizing separable convex objective on arbitrarily directed trees of variable upperbound constraints, Mathematics of Operations Research, 16, 504-533, 1991.
12. Lu Lu and M. Posner. Approximation procedures for the one-warehouse multiretailer system, management Science, 40, 1305-1316, 1994.
13. W.L. Maxwell and J.A. Muckstadt. Establishing consistent and realistic reorder intervals in Production-distribution systems, Operations Research, 33, 1316-1341, 1985.
14. J.A. Muckstadt and R.O. Roundy. Analysis of Multisatage Production Systems, in: S.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin (ed.) Logistics of Production and Inventory, North Holland, 59-131, 1993.
15. M. Queyranne. Finding 94%-effective policies in linear time for some production/inventory systems, Unpublished manuscript, 1987.
16. P. Raghavan and C. Thompson. Randomized rounding: a technique for provably good algorithms and algorihmic proofs, Combinatorica 7, 365-374, 1987.
17. M. Rosenblatt and M. Kaspi. A dynamic programming algorithm for joint replenishment under general order cost functions, Management Science, 31, 369-373, 1985.
18. R.O. Roundy. 98% Effective integer-ratio lot-sizing for one warehouse multiretailer systems, Management Science, 31(11), 1416-1430, 1985.
19. R.O. Roundy. A 98% Effective lot-sizing rule for a multi-product, multi-stage production inventory system, Mathematics of Operations Research, 11, 699-727, 1986.
20. R.O. Roundy. Rounding off to powers of two in continuous relaxations of capacitated lot sizing problems, Management Science, 35, 1433-1442, 1989.
21. Y.S. Zheng. Replenishment strategies for production/distribution networks with general joint setup costs, Ph.D. Thesis, Columbia University, New York, 1987.