Paper Info
Title
Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
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.
Year
DOI
Venue
2007
10.1007/s10479-006-0157-x
Annals OR
Keywords
Field
DocType
Lot sizing,Scheduling,Packaging
Heuristic,Mathematical optimization,Job shop scheduling,Scheduling (computing),Production line,Sizing,Local search (optimization),Mathematics
Journal
Volume
Issue
ISSN
150
1
0254-5330
Citations 
PageRank 
References 
16
0.94
9
Authors
3
Name
Order
Citations
PageRank
Fabrizio Marinelli125820.55
Maria Elena Nenni2171.98
Antonio Sforza317316.22