Abstract

AbstractThis paper presents a simple heuristic for scheduling the production of many items on a single machine when demands are both dynamic and stochastic. The heuristic is based on {s, S) type policies and relies principally on simulations of the upcoming production days (the Lookahead function) to decide if the production facility should be shut down or not on a given working shift. Comparative simulation test results show that, under varying production conditions, the Lookahead heuristic provides low total inventory and changeover costs while maintaining high service level.

Full Text
Paper version not known

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

Disclaimer: 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.