Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company |
| |
Authors: | Fabrizio Marinelli Maria Elena Nenni Antonio Sforza |
| |
Institution: | (1) Dipartimento di Informatica, Università degli Studi di L’Aquila, Via Vetoio – Coppito, 67100 L’Aquila, Italy;(2) Dipartimento di Progettazione e Gestione Industriale, Università degli Studi di Napoli “Federico II”, Piazzale Tecchio 80, 80125 Napoli, Italy;(3) Dipartimento di Informatica e Sistemistica, Università degli Studi di Napoli “Federico II”, Via Claudio 21, 80125 Napoli, Italy |
| |
Abstract: | The aim of this work is to propose a solution approach for a capacitated lot sizing and scheduling real problem with parallel
machines and shared buffers, arising in a packaging company producing yoghurt. The problem has been formulated as a hybrid
Continuous Set-up and Capacitated Lot Sizing Problem (CSLP–CLSP). A new effective two stage optimisation heuristic based on
the decomposition of the problem into a lot sizing problem and a scheduling problem has been developed. An assignment of mixture
to buffers is made in the first stage, and therefore the corresponding orders are scheduled on the production lines by performing
a local search. Computational tests have been performed on the real data provided by the company. The heuristic exhibits near-optimal
solutions, all obtained in a very short computational time. |
| |
Keywords: | Lot sizing Scheduling Packaging |
本文献已被 SpringerLink 等数据库收录! |
|