The Single Item Dynamic Lot Sizing Problem with Minimum Lot Size Restriction

2009 ◽  
pp. 91-96
Author(s):  
Irena Okhrin ◽  
Knut Richter
Keyword(s):  
Lot Sizing ◽  
Lot Size ◽  
Single Item ◽  
Lot Sizing Problem ◽  
Dynamic Lot Sizing ◽  
Size Restriction

Single Item Lot Sizing Models with Bounded Inventory and Remanufacturing

2010 ◽  
Vol 102-104 ◽  
pp. 791-795
Author(s):  
Neng Min Wang ◽  
Zheng Wen He ◽  
Qiu Shuang Zhang ◽  
Lin Yan Sun
Keyword(s):  
Lot Sizing ◽  
Dynamic Programming Algorithm ◽  
Production Capacity ◽  
Planning Horizon ◽  
Programming Algorithm ◽  
Single Item ◽  
Time Dynamic ◽  
Lot Sizing Problem ◽  
Dynamic Lot Sizing ◽  
Finite Planning Horizon

Dynamic lot sizing problem for systems with bounded inventory and remanufacturing was addressed. The demand and return amounts are deterministic over the finite planning horizon. Demands can be satisfied by manufactured new items, but also by remanufactured returned items. In production planning, there can be situations where the ability to meet customer demands is constrained by inventory capacity rather than production capacity. Two different limited inventory capacities are considered; there is either bounded serviceables inventory or bounded returns inventory. For the two inventory case, we present exact, polynomial time dynamic programming algorithm based on the idea of Teunter R, et al. (2006).

scholarly journals Economic lot-sizing problem with remanufacturing option: complexity and algorithms

2021 ◽  
Author(s):  
Ashwin Arulselvan ◽  
Kerem Akartunalı ◽  
Wilco van den Heuvel
Keyword(s):  
Polynomial Time ◽  
Lot Sizing ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Single Item ◽  
Inventory Costs ◽  
Time Period ◽  
Lot Sizing Problem ◽  
Dynamic Lot Sizing ◽  
The Cost

AbstractIn a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single item in every time period. The problem seeks a solution that determines how much to produce and carry at each time period, so that we will incur the least amount of production and inventory cost. When the remanufacturing option is included, the input comprises of number of returned products at each time period that can be potentially remanufactured to satisfy the demands, where remanufacturing and inventory costs are applicable. For this problem, we first show that it cannot have a fully polynomial time approximation scheme. We then provide a polynomial time algorithm, when we make certain realistic assumptions on the cost structure.

scholarly journals A heuristic solution of multi-item single level capacitated dynamic lot-sizing problem

1970 ◽  
Vol 38 ◽  
pp. 1-7 ◽  
Author(s):  
Sultana Parveen ◽  
AFM Anwarul Haque
Keyword(s):  
Lot Sizing ◽  
Research Work ◽  
Optimal Solution ◽  
Point Of View ◽  
Lot Size ◽  
Heuristic Solution ◽  
Single Level ◽  
Solution Algorithms ◽  
Lot Sizing Problem ◽  
Dynamic Lot Sizing

The multi-item single level capacitated dynamic lot-sizing problem consists of scheduling N items over a horizon of T periods. The objective is to minimize the sum of setup and inventory holding costs over the horizon subject to a constraint on total capacity in each period. No backlogging is allowed. Only one machine is available with a fixed capacity in each period. In case of a single item production, an optimal solution algorithm exists. But for multi-item problems, optimal solution algorithms are not available. It has been proved that even the two-item problem with constant capacity is NP (nondeterministic polynomial)-hard. That is, it is in a class of problems that are extremely difficult to solve in a reasonable amount of time. This has called for searching good heuristic solutions. For a multi-item problem, it would be more realistic to consider an upper limit on the lot-size per setup for each item and this could be a very important parameter from practical point of view. The current research work has been directed toward the development of a model for multi-item problem considering this parameter. Based on the model a program has been executed and feasible solutions have been obtained. Keywords: Heuristics, inventory, lot-sizing, multi-item, scheduling.DOI: 10.3329/jme.v38i0.893 Journal of Mechanical Engineering Vol.38 Dec. 2007 pp.1-7

MINIMALISASI BIAYA SIMPAN DAN BIAYA SETUP PADA MULTIPLE PRODUK: SIMULASI DENGAN CAPACITATED LOT SIZING PROBLEM

2019 ◽  
Vol 4 (2) ◽  
pp. 205-214
Author(s):  
Erika Fatma
Keyword(s):  
Production Cost ◽  
Lot Sizing ◽  
Setup Time ◽  
Production Costs ◽  
Total Production ◽  
Product Cycle ◽  
Lot Size ◽  
Setup Costs ◽  
Lot Sizing Problem ◽  
Capacitated Lot Sizing

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