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: | , , , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2015
|
| Subjects: | |
| Online Access: | 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 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |