An Improved Extended Basic Period Procedure for Solving the Economic Lot Scheduling Problem
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Abstract This paper describes an easily programmable procedure for solving the problem of determining lot sizes for n products to be produced on a single machine. The procedure is based upon the extended basic period approach of Elmagrahby. Feasible solutions are obtained by restricting the number of periods between runs for each product to the powers of 2. The effectiveness of the procedure is demonstrated by solving six problems originally solved by Fujita. Significantly better answers were found for five of the six while in one case the procedure generated a solution that was only slightly inferior.