A math-heuristic Dantzig-Wolfe algorithm for the capacitated lot sizing problem

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

Volumn 7219 LNCS, Issue , 2012, Pages 31-41

  Caserta, Marco ^a   Voß, Stefan ^b  

^a IE BUSINESS SCHOOL   (Spain)

^b UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITATED LOT SIZING PROBLEM; COMPUTATIONAL TIME; IN-LINE; METAHEURISTIC; MULTI-ITEM; MULTI-PERIOD; OPTIMIZATION PROBLEMS; PRODUCTION PLANNING;

OPTIMIZATION; PRODUCTION CONTROL;

HEURISTIC ALGORITHMS;

EID: 84867880428     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34413-8_3     Document Type: Conference Paper

References (16)

1. Aras, O.A.: A Heuristic Solution Procedure for a Single-Facility Multi-Item Dynamic Lot Sizing and Sequencing Problem. PhD thesis, Syracuse University (1981)
2. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch and Price: Column Generation for Huge Integer Programs. Operations Research 46(3), 316-329 (1998)
3. Belvaux, G., Wolsey, L.A.: BC-PROD: A Specialized Branch-and-Cut System for Lot-Sizing Problems. Management Science 46(5), 724-738 (2000)
4. Constantino, M.: A Cutting Plane Approach to Capacitated Lot-Sizing with Startup Costs. Mathematical Programming B 75(3), 353-376 (1996)
5. Dzielinski, M.A.H., Gomory, R.E.: Optimal Programming of Lot-Sizing Inventory and Labor Allocation. Management Science 11(9), 874-890 (1965)
6. Eppen, G.D., Martin, R.K.: Solving Multi-Item Lot-Sizing Problems Using Variable Redefinition. Operations Research 35(6), 832-848 (1987)
7. Jans, R., Degraeve, Z.: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot Sizing Problem with Setup Times. Operations Research 55(5), 909-920 (2007)
8. Jans, R., Degraeve, Z.: Meta-heuristics for Dynamic Lot Sizing: A Review and Comparison of Solution Approaches. European Journal of Operational Research 177(3), 1855-1875 (2007)
9. Maniezzo, V., Stützle, T., Voß, S. (eds.): Matheuristics - Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems, vol. 10. Springer (2010)
10. Manne, A.S.: Programming of Economic Lot Sizes. Management Science 4(2), 115-135 (1958)
11. Miller, A.J., Nemhauser, G.L., Savelsbergh, M.W.: Solving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch and Cut. Core dp 2000/39, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (August 2000)
12. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley (1999)
13. Pochet, Y., Wolsey, L.A.: Polyhedra for Lot Sizing with Wagner-Whitin Costs. Mathematical Programming B 67(1-3), 297-323 (1994)
14. Sniedovich, M., Voß, S.: The Corridor Method: A Dynamic Programming Inspired Metaheuristic. Control and Cybernetics 35(3), 551-578 (2006)
15. Trigeiro, W.W., Thomas, L.J., McClain, J.O.: Capacitated Lot-sizing With Setup Times. Management Science 35(3), 353-366 (1989)
16. Vanderbeck, F., Savelsbergh, M.W.P.: A Generic View of Dantzig-Wolfe Decomposition in Mixed Integer Programming. Operations Research Letters 34(3), 296-306 (2006)