Abstract
We consider a multi-period single-item production scheduling problem with a deterministic, time-varying demand pattern and concave cost functions. Optimal production lot sizes, so as to minimize the total costs of production, set-up, and inventory, are determined subject to dynamic production capacity and no backlogs. The proposed algorithm was tested extensively by solving several randomly generated problems with varying degrees of complexity. The proposed algorithm appears to perform quite reasonably for practical applications.
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.
