scholarly journals The multi-period multi-level capacitated lot-sizing and scheduling problem in the dairy soft-drink industry

Author(s):  
Abderrahmene Mediouni ◽  
Nicolas Zufferey ◽  
Mansour Rached ◽  
Naoufel Cheikhrouhou
2015 ◽  
Vol 2015 ◽  
pp. 1-18 ◽  
Author(s):  
Claudio F. M. Toledo ◽  
Alf Kimms ◽  
Paulo M. França ◽  
Reinaldo Morabito

This paper presents the synchronized and integrated two-level lot sizing and scheduling problem (SITLSP). This problem is found in beverage production, foundry, glass industry, and electrofused grains, where the production processes have usually two interdependent levels with sequence-dependent setups in each level. For instance, in the first level of soft drink production, raw materials are stored in tanks flowing to production lines in the second level. The amount and the time the raw materials and products have to be stored and produced should be determined. A synchronization problem occurs because the production in lines and the storage in tanks have to be compatible with each other throughout the time horizon. The SITLSP and its mathematical model are described in detail by this paper. The lack of similar models in the literature has led us to also propose a set of instances for the SITLSP, based on data provided by a soft drink company. Thus, a set of benchmark results for these problem instances are established using an exact method available in an optimization package. Moreover, results for two relaxations proved that the modeling methodology could be useful in real-world applications.


2018 ◽  
Vol 189 ◽  
pp. 06002
Author(s):  
Dandan Zhang ◽  
Canrong Zhang

The capacitated lot-sizing and scheduling problem with sequence-dependent setup time and carryover setup state is a challenge problem in the semiconductor assembly and test manufacturing. For the problem, a new mixed integer programming model is proposed, followed by exploring its relative efficiency in obtaining optimal solutions and linearly relaxed optimal solutions. On account of the sequence-dependent setup time and the carryover of setup states, a per-machine Danzig Wolfe decomposition is proposed. We then build a statistical estimation model to describe correlation between the optimal solutions and two lower bounds including the linear relaxation solutions, and the pricing sub-problem solutions of Danzig Wolfe decomposition, which gives insight on the optimal values about information regarding whether or not the setup variables in the optimal solution take the value of 1, and the information is further used in the branch and select procedure. Numerical experiments are conducted to test the performance of the algorithm.


Sign in / Sign up

Export Citation Format

Share Document