The economic lot scheduling problem: A pure genetic search approach

Computers and Operations Research

Volumn 34, Issue 10, 2007, Pages 2865-2881

  Chatfield, Dean C ^a  

^a PAMPLIN COLLEGE OF BUSINESS   (United States)

Author keywords

ELSP; Genetic algorithms; Heuristics; Lot sizing; Meta heuristics; Production and inventory systems; Production scheduling; Single machine scheduling

Indexed keywords

DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; HEURISTIC METHODS; INVENTORY CONTROL; PROBLEM SOLVING;

ECONOMIC LOT SCHEDULING PROBLEM (ELSP); LOT SIZING; PRODUCTION SCHEDULING; SINGLE MACHINE SCHEDULING;

SCHEDULING;

EID: 33847643247     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.11.001     Document Type: Article

References (37)

1. Manne A.S. Programming of economic lot sizes. Management Science 4 2 (1958) 115-135
2. Rogers J. A computational approach to the lot scheduling problem. Management Science 3 3 (1958) 264-291
3. Bomberger E. A dynamic programming approach to a lot scheduling problem. Management Science 12 (1966) 778-784
4. Elmaghraby S. The economic lot size problem (ELSP). review and extensions. Management Science 24 (1978) 587-598
5. Hsu W. On the general feasibility test of scheduling lot sizes for several products on one machine. Management Science 29 (1983) 93-105
6. Davis S. Scheduling economic lot size production runs. Management Science 36 (1990) 985-998
7. Lopez M., and Kingsman B. The economic lot scheduling problem. theory and practice. International Journal of Production Economics 23 (1991) 147-164
8. Moon I., Silver E.A., and Choi S. Hybrid genetic algorithm for the economic lot scheduling problem. International Journal of Production Research 40 4 (2002) 809-824
9. Goyal S.K. Scheduling a multi-product single machine system-a new approach. International Journal of Production Research 13 (1975) 487-493
10. Dobson G. The ELSP. achieving feasibility using time-varying lot sizes. Operations Research 35 5 (1987) 764-771
11. Hansmann F. Operations research in production and inventory (1962), Wiley, New York
12. Doll C.L., and Whybark D.C. An iterative procedure for the single machine multi-product lot scheduling problem. Management Science 20 (1973) 50-55
13. Goyal S.K. Scheduling a multi-product, single-machine system. Operational Research Quarterly 24 2 (1973) 261-266
14. Haessler R. A note on scheduling a multi-product single machine system for an infinite planning period. Management Science 17 (1971) B240-B241
15. Haessler R., and Hogue S. A note on the single-machine multi-product lot scheduling problem. Management Science 22 8 (1976) 909-912
16. Madigan J.G. Scheduling a multi-product single machine system for an infinite planning period. Management Science 14 (1968) 713-719
17. Stankard M., and Gupta S. A note on Bomberger's approach to lot size scheduling. heuristic proposed. Management Science 15 (1969) 449-452
18. Larrañeta J., and Onieva L. The economic lot size problem. a simple approach. Journal of the Operational Research Society 39 (1988) 373-379
19. Chatfield D. Applying the traditional genetic algorithm-the economic lot scheduling problem. Masters paper, Department of Management Science and Information Systems, The Pennsylvania State University; 1993.
20. Grznar J., and Riggle C. An optimal algorithm for the basic period approach to the economic lot schedule problem. Omega 25 3 (1997) 355-364
21. Khouja M., Michalewicz Z., and Wilmot M. The use of genetic algorithms to solve the economic lot scheduling problem. European Journal of Operational Research 110 (1998) 509-524
22. Elmaghraby S. An extended basic period approach to the economic lot scheduling problem (ELSP). In: Muramatsu R., and Dudley N.A. (Eds). Production and industrial systems (1977) 649-662
23. Fujita S. The application of marginal analysis to the ELSP. AIIE Transactions 10 4 (1978) 354-361
24. Axsäter S. An extension of the extended basic period approach for economic lot scheduling problems. Journal of Optimization Theory and Applications 52 2 (1987) 179-189
25. Phillipoom P., Rees L., and Taylor B. Solving the ELSP using the method of prime subperiods. Decision Sciences 20 (1989) 794-809
26. Haessler R. An improved extended basic period approach for solving the ELSP. AIIE Transactions 11 4 (1979) 336-340
27. C. Tunasar, J. Rajgopal, An evolutionary computation approach to the economic lot scheduling problem. Technical Report No. TR 96-1, Department of Industrial Engineering, University of Pittsburgh; 1996.
28. Park K., and Yun D. A stepwise partial enumeration algorithm for the economic lot scheduling problem. IIE Transactions 16 4 (1984) 363-370
29. Delporte C., and Thomas L. Lot sizing and sequencing for N products on one factility. Management Science 23 10 (1977) 1070-1079
30. Zipkin P. Computing optimal lot sizes in the ELSP. Operations Research 39 1 (1991) 56-63
31. Roundy R. Rounding off to powers of two in continuous relaxations of capacitated lot sizing problems. Management Science 35 12 (1989) 1433-1442
32. Hodgson T. Addendum to Stankard and Gupta's note on lot size scheduling. Management Science 16 7 (1970) 514-517
33. Arcade S.H. Single machine multi-product batch scheduling. testing several solution methods. Omega 21 6 (1993) 709-711
34. Goldberg D. Genetic algorithms in search, optimization, and machine learning (1989), Addison-Wesley Publishing Company, Reading
35. Davis L., and Steenstrup M. Genetic algorithms and simulated annealing. an overview. In: Davis L. (Ed). Genetic algorithms and simulated annealing (1987), Morgan Kaufman Publishers, San Mateo 1-11
36. Davis L. The handbook of genetic algorithms (1991), Van Norstrand Reinhold, New York
37. Boctor F. A more efficient formulation of the single machine, static demand, lot scheduling problem. Engineering Costs and Production Economics 14 (1988) 3-10