A cutting plane approach to capacitated lot-sizing with start-up costs |
| |
Authors: | Miguel Constantino |
| |
Affiliation: | (1) CORE, Université Catholique de Louvain, 1348 Louvain-la-Neuve, Belgium;(2) Present address: DEIO, Universidade de Lisboa, Bloco C2, Campo Grande, 1700 Lisboa, Portugal |
| |
Abstract: | We consider a mixed integer model for multi-item single machine production planning, incorporating both start-up costs and machine capacity. The single-item version of this model is studied from the polyhedral point of view and several families of valid inequalities are derived. For some of these inequalities, we give necessary and sufficient facet inducing conditions, and efficient separation algorithms. We use these inequalities in a cutting plane/branch and bound procedure. A set of real life based problems with 5 items and up to 36 periods is solved to optimality. |
| |
Keywords: | Capacitated lot-sizing Start-up costs Valid inequalities Cutting plane algorithm |
本文献已被 SpringerLink 等数据库收录! |
|