Article ID: | iaor20091134 |
Country: | Netherlands |
Volume: | 159 |
Issue: | 1 |
Start Page Number: | 315 |
End Page Number: | 331 |
Publication Date: | Mar 2008 |
Journal: | Annals of Operations Research |
Authors: | Sarimveis Haralambos, Doganis Philip |
Keywords: | scheduling, programming: integer |
The increasing variety of products offered by the food industry has helped the industry to respond to market trends, but at the same time has resulted in a more complex production process, which requires flexibility and an efficient coordination of existing resources. Especially in industrial yogurt production, there is a wide variety of products that differ in features like fat content, the whey used to produce the mixture, the flavor, the size of the container or the language on the label. The great diversification and the special features that characterize yogurt production lines (satisfaction of multiple due dates, variable processing times, sequence-dependent setup times and costs and monitoring of inventory levels), render generic scheduling methodologies impractical for real-world applications. In this work we present a customized Mixed Integer Linear Programming model for optimizing yogurt packaging lines that consist of multiple parallel machines. The model is characterized by parsimony in the utilization of binary variables and necessitates the use of only a small pre-determined number of time periods. The efficiency of the proposed model is illustrated through its application to the yogurt production plant of a leading dairy product manufacturing company in Greece.