Period decompositions for the capacitated lot size problem with setup times

• المؤلفون الرئيسيون: DE ARAUJO, Silvio Alexandre, DE REYCK, Bert, DEGRAEVE, Zeger, FRAGKOS, Ioannis, JANS, Raf
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2015
• الموضوعات: lot sizing; column generation; Lagrange relaxation; branch and price; heuristics; Business Administration, Management, and Operations; Numerical Analysis and Computation
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/lkcsb_research/6761; https://ink.library.smu.edu.sg/context/lkcsb_research/article/7743/viewcontent/Period_Decompositions_for_the_Capacitated_Lot_Sizing_Problem_with_Setup_Times.pdf
• المؤسسة: Singapore Management University

We study the multi-item capacitated lot sizing problem with setup times. Based on two strong reformulations of the problem, we present a transformed reformulation and valid inequalities that speed up column generation and Lagrange relaxation. We demonstrate computationally how both ideas enhance the...