Multiple Machine Continuous Setup Lotsizing with Sequence-dependent Setups

• Autor(es): Bernardo Almada-Lobo ; Diego Klabjan ; Maria Antónia Carravilla ; José F. Oliveira
• Data: 2010
• Identificador Persistente: http://hdl.handle.net/10216/6961
• Origem: Repositório Aberto da Universidade do Porto
• Assunto(s): Ciências Tecnológicas; Engenharia; Engenharia industrial
• Tipo de Documento: Artigo
• Idioma: Inglês

Descrição

We address the short-term production planning and scheduling problem coming from the glass container industry. A furnace melts the glass that is distributed to a set of parallel molding machines. Both furnace and machine idleness are not allowed. The resulting multi-machine multi-item continuous setup lotsizing problem with a common resource has sequence-dependent setup times and costs. Production losses are penalized in the objective function since we deal with a capital intensive industry. We present two mixed integer programming formulations for this problem, which are reduced to a network flow type problem. The two formulations are improved by adding valid inequalities that lead to good lower bounds. We rely on a Lagrangian decomposition based heuristic for generating good feasible solutions. We report computational experiments for randomly generated instances and for real-life data on the aforementioned problem, as well as on a discrete lotsizing and scheduling version.