A Heuristic Solution of Multi-Item Single Level Capacitated Dynamic Lot-Sizing Problem with Setup Time

Sultana Parveen; Md. Ahsan Akthar Hasin

doi:10.4028/www.scientific.net/AMR.264-265.1794

Paper Titles

A Study on Cooling Characteristics of Thermoelectric Cooling System Using Thermoelectric Materials
p.1770

Investigation on Constant and Variable Feed Speeds Effects in Ring Rolling Process Using 3D FEM
p.1776

The Effect of Lithium on the Microstructure and Morphology of Fe-Rich Intermetallic Compounds in 360 Cast Alloy
p.1782

Polishing Force Modification near the Boundary of a Part Surface
p.1788

A Heuristic Solution of Multi-Item Single Level Capacitated Dynamic Lot-Sizing Problem with Setup Time
p.1794

Statistical Wear Model for Adhesively Bonded Tools
p.1802

Study on Machining Characteristic of Aeronautical Material under Orthogonal Dry Cutting
p.1812

Finite Element Method for Predicting the Cohesive Strength of DLC Film on 316L Stainless Steel by Four Point Bend Test and Validation with Experimental Results
p.1823

Effect of Nano Silica on the Sinterability of Hydroxyapatite Dense Bodies
p.1832

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 264-265A Heuristic Solution of Multi-Item Single Level...

A Heuristic Solution of Multi-Item Single Level Capacitated Dynamic Lot-Sizing Problem with Setup Time

Abstract:

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.

You might also be interested in these eBooks

Advances in Materials and Processing Technologies II

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 264-265)

Pages:

1794-1801

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.264-265.1794

Citation:

Cite this paper

Online since:

June 2011

Authors:

Sultana Parveen, Md. Ahsan Akthar Hasin

Keywords:

Heuristics, Inventory, Lot Sizing, Setup Time

Export:

RIS, BibTeX

Price:

Permissions:

Request Permissions

References

[1] N. Brahimi, S. Dauzere-Peres, N.M. Najid, A. Nordli, Single item lot-sizing problems, European Journal of Operational Research, Vol. 168 (2006), 1–16.

DOI: 10.1016/j.ejor.2004.01.054

Google Scholar

[2] V.C.P.M. Hoesel, A.P.M. Wagelmans, Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems, Mathematics of Operations Research, Vol. 26(2) (2001), 339–57.

DOI: 10.1287/moor.26.2.339.10552

Google Scholar

[3] E.A. Silver, H.C. Meal, A heuristic for selecting lot-size quantities for the case of a deterministic time varying demand rate and discrete opportunities for replenishment, Production and Inventory Management, Vol. 14 (2), (1973), 64–74.

Google Scholar

[4] H. Shaker, Multi-echelon inventory problem in constant usage rate situation: multi-modal dispatching, Journal of Production Research, Vol. 4 (2), (2006), 50-52.

Google Scholar

[5] P.S. Eisenhut, A dynamic lot-sizing algorithm with capacity constraints, AIIE Transactions, Vol. 7 (2) (1975) 170-176.

DOI: 10.1080/05695557508974999

Google Scholar

[6] P.S. Dixon and E.A. Silver, A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem, Journal of Operations Management, Vol. 1, (1981), 23-38.

DOI: 10.1016/0272-6963(81)90033-4

Google Scholar

[7] C. Harris, An algorithm for solving stochastic multi-echelon inventory problem, Journal of Production Research, Vol. 5 (3) (2007) 90-101.

Google Scholar

[8] M.P. Brunett, A disaggregation model for solving computational complexity in multi-item inventory problem, International Journal of Operations Management, Vol. 15 (2/3), (2007), 101-112.

Google Scholar

[9] J.R. Adam, Global search for economic lot-sizing for multi-item ordering policy, Interna-tional Journal of Operations Management, Vol. 15 (1), (2007), 10-18.

Google Scholar

[10] S. Parveen, and M.A.A. Hasin, Multi-item capacity constrained dynamic lot-sizing and sequencing with setup time, Journal of Mechanical Engineering, (2009), to appear.

DOI: 10.3329/jme.v40i2.5352

Google Scholar

[11] S. Parveen, Meta-heuristic approach to supply chain optimization in an integrated hierarchi-cal production planning system, PhD thesis, (2009), Bangladesh University of Engineering and Technology (BUET), Bangladesh.

Google Scholar