An improved algorithm for solving the economic lot size problem (ELSP)
Author:
- 27 April 1995
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 33 (4) , 1007-1026
Abstract
A bounded enumeration combining non-linear optimization, heuristic procedure, and mixed integer programming is proposed to solve the capacitated multi-item lot scheduling problem. The combined effect is demonstrated by a better solution to problem data which has been the subject of inquiry and investigation for over 20 years. In addition, the approach avoids the escape from infeasibilily deficiencies of prior solution procedures. The attractiveness of the solution found can be confirmed by the close proximity of the production run frequency to that obtained from the independent solution. Since the independent solution reflects the optimum economic tradeoff between incurring setup costs and inventory carrying costs for each product individually, the advantages of deriving a multi-product production schedule where the frequency of setups conform to these cost relationships are obvious.Keywords
This publication has 10 references indexed in Scilit:
- Computing Optimal Lot Sizes in the Economic Lot Scheduling ProblemOperations Research, 1991
- Scheduling Economic Lot Size Production RunsManagement Science, 1990
- The Economic Lot-Scheduling Problem: A Simple ApproachJournal of the Operational Research Society, 1988
- The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot SizesOperations Research, 1987
- On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One MachineManagement Science, 1983
- The Economic Lot Scheduling Problem (ELSP): Review and ExtensionsManagement Science, 1978
- An Iterative Procedure for the Single-Machine Multi-Product Lot Scheduling ProblemManagement Science, 1973
- Scheduling a Multi-Product Single Machine SystemJournal of the Operational Research Society, 1973
- Letter to the Editor—A Note on Scheduling a Multi-Product Single Machine System for an Infinite Planning PeriodManagement Science, 1971
- A Dynamic Programming Approach to a Lot Size Scheduling ProblemManagement Science, 1966