A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery

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-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 the setup time, since switching the machine from one item to another would require a setup time. This setup time would be independent of item sequences 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 multiitem problem considering this parameter. Based on the model a program has been executed and feasible solutions with some real life data have been obtained.

Download Full-text

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

Journal of Mechanical Engineering ◽

10.3329/jme.v38i0.893 ◽

1970 ◽

Vol 38 ◽

pp. 1-7 ◽

Cited By ~ 1

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

Download Full-text

Dynamic lot sizing problem for a warm/cold process

IIE Transactions ◽

10.1080/07408170600854511 ◽

2006 ◽

Vol 38 (11) ◽

pp. 1027-1044 ◽

Cited By ~ 9

Author(s):

Ayhan Özgür Toy ◽

Emre Berk

Keyword(s):

Lot Sizing ◽

Lot Sizing Problem ◽

Dynamic Lot Sizing

Download Full-text

The dynamic lot-sizing problem with variable unit costs

International Journal of Systems Science ◽

10.1080/00207729508929122 ◽

1995 ◽

Vol 26 (9) ◽

pp. 1593-1600

Author(s):

CHING-JONG LIAO ◽

TSUNG-SHIN HSU

Keyword(s):

Lot Sizing ◽

Unit Costs ◽

Lot Sizing Problem ◽

Dynamic Lot Sizing

Download Full-text

Dynamic lot sizing problem under uncertainty of returned products in remanufacturing industry

MATEC Web of Conferences ◽

10.1051/matecconf/201820407005 ◽

2018 ◽

Vol 204 ◽

pp. 07005

Author(s):

Iman Setyoaji

Keyword(s):

Bayesian Inference ◽

Lot Sizing ◽

Replacement Ratio ◽

Total Cost ◽

Lot Sizing Problem ◽

Holding Cost ◽

Dynamic Lot Sizing ◽

Lot Sizes

Remanufacturing processes face uncertainty in the quality of the items being returned by customers, this significant variability complicates the control of inventories. Demands can be satisfied by procured new items, but also by remanufactured returned items. This paper develops dynamic lot sizing model for remanufacturing industry under uncertainty of returned items and proposes Bayesian Inference to estimate the replacement ratio of returned items that used to determine those lot sizes for new items. The objective of this paper is to minimize the total cost composed of holding cost and set-ups cost. A numerical example is provided based on case study. The result shows that total cost is reduced to be 45%.

Download Full-text