A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches

2018 ◽  
Vol 90 ◽  
pp. 125-141 ◽  
Author(s):  
Douglas Alem ◽  
Eduardo Curcio ◽  
Pedro Amorim ◽  
Bernardo Almada-Lobo
Author(s):  
Huda Muhamad Badri ◽  
Nor Kamaliana Khamis ◽  
Mariyam Jameelah Ghazali

2017 ◽  
Vol 17 (1) ◽  
pp. 41-44
Author(s):  
J. Duda ◽  
A. Stawowy

Abstract A novel approach for treating the uncertainty about the real levels of finished products during production planning and scheduling process is presented in the paper. Interval arithmetic is used to describe uncertainty concerning the production that was planned to cover potential defective products, but meets customer’s quality requirement and can be delivered as fully valuable products. Interval lot sizing and scheduling model to solve this problem is proposed, then a dedicated version of genetic algorithm that is able to deal with interval arithmetic is used to solve the test problems taken from a real-world example described in the literature. The achieved results are compared with a standard approach in which no uncertainty about real production of valuable castings is considered. It has been shown that interval arithmetic can be a valuable method for modeling uncertainty, and proposed approach can provide more accurate information to the planners allowing them to take more tailored decisions.


Author(s):  
Willy Alves de Oliveira Soler ◽  
Maristela Oliveira Santos ◽  
Maria do Socorro Nogueira Rangel

The purpose of this paper is to propose mathematical models to represent a lot sizing and scheduling problem on multiple production lines that share scarce resources and to investigate the computational performance of the proposed models. The main feature that differentiates this problem from others in the literature is that the decision on which lines to organize should be taken considering the availability of the necessary resources. The optimization criterion is the minimization of the costs incurred in the production process (inventory, backlogging, organization of production lines, and sequence-dependent setup costs). Nine mixed integer optimization models to represent the problem are given and, also, the results of an extensive computational study carried out using a set of instances from the literature. The computational study indicates that an efficient formulation, able to provide high quality solutions for large sized instances, can be obtained from a classical model by making the binary production variables explicit, using the facility location reformulation as well as the single commodity flow constraints to eliminate subsequences. Moreover, from the results, it is also clear that the consideration of scarce resources makes the problem significantly more difficult than the traditional one.


Sign in / Sign up

Export Citation Format

Share Document