Lot-sizing and scheduling in a glass container manufacture company Online publication date: Thu, 26-Mar-2015
by Agostinho Agra, Catarina Avelino, Adelaide Cerveira, Alexandrino Delgado, Michael Poss
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 2, No. 3, 2011
Abstract: We consider a real production planning problem occurring in a glass container manufacturing company. The goal is to minimise the average stock level during a planning horizon of one year, maintaining customers satisfaction and keeping the production at its maximum rate. Besides the production capacity, the main constraints considered are related to the number of setup changes in machines, which is restricted in each factory. The main goal is to find the best balance between the number of setups and the average stock level. We propose a decomposition of the problem into two interrelated problems: a lot-sizing problem and a scheduling problem. For each problem we propose a mathematical model that can be solved using a commercial solver package. To be an efficient managerial tool, the method should provide quickly good solutions. Therefore we solve the lot-sizing problem through a relax-and-fix heuristic and discuss the results.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com