Analysis of bounds for a capacitated single-item lot-sizing problem

Computers and Operations Research

Volumn 34, Issue 6 SPEC. ISS., 2007, Pages 1721-1743

  Hardin, Jill R ^a   Nemhauser, George L ^b   Savelsbergh, Martin W P ^b  

^a VIRGINIA COMMONWEALTH UNIVERSITY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; STRATEGIC PLANNING;

CORNERSTONE OPTIMIZATION; PRODUCTION PLANNING; TIME VARYING DEMAND;

PRODUCTION ENGINEERING;

EID: 33749671280     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.05.031     Document Type: Article

References (19)

1. Wagner H., and Whitin T. A dynamic version of the economic lot-size model. Management Science 5 (1958) 89-96
2. Florian M., and Klein M. Deterministic production planning with concave costs and capacity constraints. Management Science 18 (1971) 12-20
3. Chen H.-D., and Lee C.-Y. A new dynamic programming algorithm for the single item capacitated dynamic lot-size model. Journal of Global Optimization 4 (1994) 285-300
4. Leung J., Magnanti T., and Vachani R. Facets and algorithms for capacitated lot-sizing. Mathematical Programming 45 (1989) 331-359
5. Pochet Y. Valid inequalities and separation for capacitated economic lot-sizing. Operations Research Letters 7 (1988) 109-115
6. Pochet Y., and Wolsey L. Polyhedra for lot-sizing with Wagner-Whitin costs. Mathematical Programming 67 (1994) 297-323
7. Miller A. Polyhedral approaches to capacitated lot-sizing problems. Ph.D. thesis, Georgia Institute of Technology, 1999.
8. Van Hoesel C., and Wagelmans A. Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Mathematics of Operations Research 26 (2001) 339-357
9. Bitran G., and Yanasse H. Computational complexity of the capacitated lot-size problem. Management Science 28 (1982) 1174-1186
10. Vazirani V. Approximation algorithms (2001), Springer, New York
11. Bar-Noy A., Guha S., Naor J., and Schieber B. Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing 31 (2001) 331-352
12. Goemans M.X., Queyranne M., Schulz A.S., Skutella M., and Wang Y. Single machine scheduling with release dates. SIAM Journal on Discrete Mathematics 15 (2002) 165-192
13. Hall L.A., Schulz A.S., Shmoys D.B., and Wein J. Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research 22 (1997) 513-544
14. Savelsbergh M., Uma R., and Wein J. An experimental study of LP-based approximation algorithms for scheduling problems. INFORMS Journal on Computing 17 (2005) 123-136
15. Schulz A.S., and Skutella M. Scheduling unrelated machines by randomized rounding. SIAM Journal on Discrete Mathematics 15 (2002) 450-469
16. 3) algorithm for the economic lot-sizing problem with constant capacities. Management Science 42 (1996) 142-150
17. Nemhauser G., and Wolsey L. Integer and combinatorial optimization (1988), Wiley, New York
18. Hardin JR. Resource-constrained scheduling and production planning: linear programming-based studies. Ph.D. thesis, Georgia Institute of Technology, 2001.
19. Csirik J., Frenk J., Labbé M., and Zhang S. Heuristics for the 0-1 min-knapsack problem. Acta Cybernetica 10 (1991) 15-20