A comparison of solution approaches for the fixed-sequence economic lot scheduling problem

IIE Transactions (Institute of Industrial Engineers)

Volumn 29, Issue 2, 1997, Pages 103-108

  Bourland, Karla E ^a   Yano, Candace A ^b  

^a DARTMOUTH COLLEGE   (United States)

^b DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; INDUSTRIAL ECONOMICS; OPTIMIZATION;

ECONOMIC LOT SCHEDULING PROBLEM; EQUAL LOT CONSTRAINT; ZERO SWITCH CONSTRAINT;

SCHEDULING;

EID: 0031071396     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179708966317     Document Type: Article

References (21)

1. Rogers, J., (1958) A computational approach to the lot scheduling problem. Management Science, 3, 264–291.
2. Elmaghraby, S.E., (1978) The economic lot scheduling problem (ELSP) review and extensions. Management Science, 24, 587–598.
3. Bomberger, E., (1966) A dynamic programming approach to a lot size scheduling problem. Management Science, 12, 778–784.
4. Hsu, W.L., (1983) On the general feasibility test of scheduling lot sizes for several products on one machine. Management Science, 29, 93–105.
5. Hanssmann, F., (1962) Operations Research in Production and Inventory Control, John Wiley and Sons, New York, pp. 158–160.
6. Jones, P.C., and Inman, R.R., (1989) When is the economic lot scheduling problem easy? IIE TRANSACTIONS, 21, 11–20.
7. Gallego, G., (1990) An extension to the class of easy economic lot scheduling problems. IIE TRANSACTIONS, 22, 189–190.
8. Schweitzer, P.J., and Silver, E.A., (1983) Mathematical pitfalls in the one machine multiproduct economic lot scheduling problem. Operations Research, 31, 401–405.
9. Muckstadt, J.A., and Singer, H.M., (1978) Comments on 'Single cycle continuous review policies for arborescent production/inventory systems '. Management Science, 24, 1766–1768.
10. Hodgson, T.J., and Nuttle, H.L.W., (1986) A note on linear programming and the single machine lot size scheduling problem. International Journal of Production Research, 24, 939–943.
11. Dobson, G., (1987) The economic lot-scheduling problem -achieving feasibility using time-varying lot sizes. Operations Research, 5, 764–771.
12. Roundy, R., (1989) Rounding off to powers of two in continuous relaxations of capacitated lot sizing problems. Management Science, 35, 1433–1442.
13. Doll, C.L., and Whybark, D.C., (1973) An iterative procedure for the single-machine multi-product lot scheduling problem. Management Science, 20, 50–55.
14. Maxwell, W.L., and Singh, H., (1986) Scheduling cyclic production on several identical machines. Operations Research, 34, 460–463.
15. Zipkin, P.H., (1991) Computing optimal lot sizes in the economic lot scheduling problem. Operations Research, 39, 56–64.
16. Dclporte, CM., and Thomas, L.J., (1977) Lot sizing and sequencing for N products on one facility. Management Science, 23, 1070–1079.
17. Bourland, K.E., and Yano, C.A., (1994) The strategic use of slack capacity in the economic lot scheduling problem with random demand. Management Science, 40, 1690–1704.
18. Maxwell, W.L., (1964) The scheduling of economic lot sizes. Naval Research Logistics Quarterly, 11, 89–124.
19. Bazaraa, M., Sherali, H D., and Shetty, C M., (1993) Nonlinear Programming Theory and Algorithms, John Wiley & Sons, New York.
20. Pardalos, P.M., and Vavasis, S.A., (1991) Quadratic programs with one negative eigenvalue is NP-hard. Journal of Global Optimization, 1, 15–22.
21. GAMS (1989) General Algebraic Modeling System, Version 2.23, The International Bank for Reconstruction and Development/The World Bank, Washington, D.C.