The economic lot scheduling problem under extended basic period and power-of-two policy

Optimization Letters

Volumn 4, Issue 2, 2010, Pages 157-172

  Sun, Hainan ^a   Huang, Huei Chuen ^b   Jaruphongsa, Wikrom ^c  

^a TECH Semiconductor Singapore PTE LTD   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c CHULALONGKORN UNIVERSITY   (Thailand)

Author keywords

ELSP; Heuristic; Parametric search algorithm; Power of two

Indexed keywords

DIVIDE AND CONQUER; ECONOMIC LOT SCHEDULING PROBLEMS; NON-LINEAR INTEGER PROGRAMMING; OPTIMAL SOLUTIONS; PLANNING HORIZONS; POWER-OF-TWO; POWER-OF-TWO POLICIES; SEARCH ALGORITHMS; SINGLE MACHINES; SPEED-UPS; STEP SIZE;

HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LEARNING ALGORITHMS; OPTIMIZATION;

PARAMETER ESTIMATION;

EID: 77955091405     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-009-0154-5     Document Type: Article

References (15)

1. Boctor F. F.: The g-group heuristic for single machine lot scheduling. Int. J. Prod. Res. 25, 363-379 (1987).
2. Bomberger E.: A dynamic programming approach to a lot size scheduling problem. Manage. Sci. 12, 778-784 (1966).
3. Chatfield D.: The economic lot scheduling problem: a pure genetic search approach. Comput. Oper. Res. 34, 2865-2881 (1987).
4. Dobson G.: The economic lot scheduling problem: achieving feasibility using time-varying lot sizes. Oper. Res. 35, 764-771 (1987).
5. Doll C. L., Whybark D. C.: An interactive procedure for the single-machine multi-product lot scheduling problem. Manage. Sci. 20, 50-55 (1973).
6. Elmaghraby S. E.: The economic lot scheduling problem (ELSP): review and extensions. Manage. Sci. 24, 587-598 (1978).
7. Geng P. C., Vickson R. G.: Two heuristics for the economic lot scheduling problem: an experimental study. Nav. Res. Logist. 35, 605-617 (1988).
8. Grznar J., Riggle C.: An optimal algorithm for the basic period approach to the economic lot scheduling problem. Omega 25, 355-364 (1997).
9. Haessler R.: An improved extended basic period procedure for solving the economic lot scheduling problem. AIIE Trans. 11, 355-364 (1979).
10. Hanssmann F.: Operations Research in Production and Inventory Control. Wiley, New York (1962).
11. Lopez M. A., Kingsman B. G.: The economic lot scheduling problem: theory and practice. Int. J. Prod. Econ. 23, 147-164 (1991).
12. Madigan J. C.: Scheduling a multi-product single machine system for an infinite planning period. Manage. Sci. 14, 713-719 (1968).
13. Roundy R.: Rounding off to powers of two in continuous relaxations of capacitated lot sizing problems. Manage. Sci. 35, 1433-1442 (1989).
14. Yao M., Elmaghraby S.: The economic lot scheduling problem under power-of-two policy. Comput. Math. Appl. 41, 1379-1393 (2001).
15. Zipkin P.: Computing optimal lot sizes in the economic lot scheduling problem. Oper. Res. 39, 56-63 (1991).