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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
