Complexity of the ELSP with general cyclic schedules

IIE Transactions (Institute of Industrial Engineers)

Volumn 29, Issue 2, 1997, Pages 109-113

  Gallego, Guillermo ^a   Shaw, Dong Xiao ^b  

^a Columbia University ^*  (United States)

^b SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INDUSTRIAL ECONOMICS; PRODUCTION;

BASIC PERIOD CYCLIC SCHEDULES; ECONOMIC LOT SCHEDULE PROBLEM; GENERAL CYCLIC SCHEDULES; LOT INVARIANT CYCLIC SCHEDULES; TIME INVARIANT CYCLIC SCHEDULES; ZERO INVENTORY CYCLIC SCHEDULES;

SCHEDULING;

EID: 0031069125     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179708966318     Document Type: Article

References (11)

1. Hsu, W.L., (1983) On the general feasibility of scheduling lot sizes of several products on one machine. Management Science, 29, 93–105.
2. Schweitzer, P.J., and Silver, E.A., (1983) Mathematical pitfalls in the one machine multi-product lot scheduling problem. Operations Research, 31, 401–405.
3. Hanssmann, F., (1962) Operations Research in Production and Inventory, John Wiley and Sons, New York, pp. 158–160.
4. Gallego, G., and Queyranne, M., (1995) Inventory coordination and pricing decisions analysis of a simple class of heuristics, in Sciomachen, A. (ed.), Optimization in Industry, vol. 3 (Mathematical Programming and Modeling Techniques in Practice), Wiley, New York, pp. 83–107
5. Doll, C., and Whybark, D., (1973) An iterative procedure for the single machine multi product lot scheduling problem. Management Science, 20, 50–55.
6. Elmaghraby, S.E., (1978) The economic lot scheduling problem (ELSP) review and extensions. Management Science, 24, 587–598.
7. Dobson, G., (1987) The economic lot scheduling problem achieving feasibility using time-varying lot sizes. Operations Research, 35, 764–771.
8. Maxwell, W.L., (1964) The scheduling of economic lot sizes. Naval Research Logistics Quarterly, 11, 98–124.
9. Delporte, CM., and Thomas, L.J., (1978) Lot sizing and sequencing for N products on one facility. Management Science, 23, 1070–1079.
10. Hodgson, T., and Nuttle, H., (1986) A note on linear programming and the single machine lot size scheduling problem. International Journal of Production Research, 24, 939–943.
11. Garey, M., and Johnson, D.S., (1979) Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York.