Clustering-based solution approach for a capacitated lot-sizing problem on parallel machines with sequence-dependent setups*

Author(s):  
François Larroche ◽  
Odile Bellenguez ◽  
Guillaume Massonnet
Author(s):  
M. Edib Gurkan ◽  
Huseyin Tunc

This study addresses the stochastic multi-item capacitated lot-sizing problem. Here, it is assumed that all items are produced on a single production resource and unmet demands are backlogged. The literature shows that the deterministic version of this problem is NP-Hard. We consider the case where period demands are time-varying random variables. The objective is to determine the minimum expected cost production plan so as to meet stochastic period demands over the planning horizon. We extend the mixed integer programming formulation introduced in the literature to capture the problem under consideration. Further, we propose a fix-and-optimize heuristic building on an item-period oriented decomposition scheme. We then conduct a numerical study to evaluate the performance of the proposed heuristic as compared to the heuristic introduced by Tempelmeier and Hilger [16]. The results clearly show that the proposed fix-and-optimize heuristic arises as both cost-efficient and time-efficient solution approach as compared to the benchmark heuristic.


Processes ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 785
Author(s):  
Jangha Kang

Since setup operations have significant impacts on production environments, the capacitated lot-sizing problem considering arbitrary length of setup times helps to develop flexible and efficient production plans. This study discusses a capacitated lot-sizing problem with sequence-dependent setup, setup carryover and setup crossover. A new mixed integer programming formulation is proposed. The formulation is based on three building blocks: the facility location extended formulation; the setup variables with indices for the starting and the completion time periods; and exponential number of generalized subtour elimination constraints (GSECs). A separation routine is adopted to generate the violated GSECs. Computational experiments show that the proposed formulation outperforms models from the literature.


2019 ◽  
Vol 4 (2) ◽  
pp. 205-214
Author(s):  
Erika Fatma

Lot sizing problem in production planning aims to optimize production costs (processing, setup and holding cost) by fulfilling demand and resources capacity costraint. The Capacitated Lot sizing Problem (CLSP) model aims to balance the setup costs and inventory costs to obtain optimal total costs. The object of this study was a plastic component manufacturing company. This study use CLSP model, considering process costs, holding costs and setup costs, by calculating product cycle and setup time. The constraint of this model is the production time capacity and the storage capacity of the finished product. CLSP can reduce the total production cost by 4.05% and can reduce setup time by 46.75%.  Keyword: Lot size, CLSP, Total production cost.


Sign in / Sign up

Export Citation Format

Share Document