Period decompositions for the capacitated lot size problem with setup times
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...
Saved in:
Main Authors: | , , , , |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2015
|
主題: | |
在線閱讀: | 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 |
語言: | English |