Abstract
A Cyclic Economic Lot-Scheduling Problem (CELSP) is formulated to solve a multistage production planning problem in a job-shop. The cyclic nature of the problem is related to the assumption of constant mean demand rates for all the end-products. Under the common cycle approach, each generic job consists of producing an end-product and its part types in the quantity required to meet the demand over the common cycle horizon. The paper shows that the CESLP can be solved in a decomposed way. A normalized scheduling problem is solved first and then the optimal value of the period is computed by an explicit formula. The solution can be easily implemented and adjusted to bounded random variations of demands.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
