An Algorithm for Economic Lot Scheduling Problem

Abstract:

The Economic Lot Scheduling Problem (ELSP) has been well-researched for over half a century. This paper, by using extended basic period approach, offers a new algorithm which differs from previous algorithms in that every item is of different importance. Such an item, whose daily cost is very high, is considered to be of greater importance and is called “key item”; and such an item, whose total production time per times is long, is considered to be of greater importance and is called “obstacle item”. By making key items’ multipliers to be of good compatibility and loading obstacle items preferentially, new algorithm can offer good solution.

• Periodical: Advanced Materials Research (Volumes 945-949)
• Pages: 3097-3101
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.945-949.3097
• Online since: June 2014
• Authors: Rong Wu Luo, Ru He Xie, Long Wen Xiao, Yi Feng Zou
• Keywords: ELSP, Lot Sizing, Production and Inventory Systems, Production Scheduling, Single Machine Scheduling

References

[1] Manne AS: Management Science 4(1958), p.115.

[2] Rogers J: Management Science 3(1958), p.264.

[3] Bomberger E. A: Management Science 12(1966), p.778.

[4] Davis S: Management Science 36(1990), p.985–98.

[5] Elmaghraby S: Management Science 24(1978), p.587–98.

[6] Lopez M and Kingsman B: International Journal of Production Economics 23(1991), p.147.

[7] Moon I, Silver EA and Choi S: International Journal of Production Research 40(2002), p.809.

[8] KC. Hing, HC. Sai and KL. Ming: Journal of Manufacturing Technology Management 24(2013), p.465.

[9] Dobson G : Operations Research 35(1987), p.764.

[10] Hsu W: Management Science 29(1983), p.93.

[11] Elmaghraby S: In: Muramatsu R, Dudley NA, editors. Production and industrial systems. 1977. p.649.

[12] Haessler R and Hogue S: Management Science 22(1976), p.909.

[13] Roundy R: Management Science 35(1989), p.1433.