A Stepwise partial enumeration algorithm for the economic lot scheduling problem
Authors:
- 1 December 1984
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 16 (4) , 363-370
Abstract
This paper presents a stepwise partial enumeration algorithm for determining the economic lot schedule of a multiproduct single facility system on a repetitive basis. The algorithm is based on a simple “sufficient feasibility” test. The algorithm starts from a feasible schedule determined from the common cycle solution and continues stepwise partial enumerations to improve the schedule until no appreciable improvement occurs. Performance of the algorithm is demonstrated by solving six problems recently solved by Haessler. The algorithm gives better or equal solutions to the problems.Keywords
This publication has 12 references indexed in Scilit:
- An Improved Extended Basic Period Procedure for Solving the Economic Lot Scheduling ProblemA I I E Transactions, 1979
- The Application of Marginal Analysis to the Economic Lot Scheduling ProblemA I I E Transactions, 1978
- The Economic Lot Scheduling Problem (ELSP): Review and ExtensionsManagement Science, 1978
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978
- Note—A Note on the Single-Machine Multi-Product Lot Scheduling ProblemManagement Science, 1976
- Scheduling a multi-product single machine system A new approachInternational Journal of Production Research, 1975
- 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
- Scheduling a Multi-Product Single Machine System for an Infinite Planning PeriodManagement Science, 1968
- A Dynamic Programming Approach to a Lot Size Scheduling ProblemManagement Science, 1966