Abstract
Abstract We address the problem of rescheduling production systems in the face of dynamic job arrivals. Using simple single-and parallel-machine models to gain insight, we provide worst-case and computational analyses of periodic and event-driven rescheduling policies. Our results indicate that event-driven policies can obtain high-quality schedules with less rescheduling than continuous rescheduling policies. We also show that if structure in the job arrival process is exploited very effective periodic rescheduling policies can be designed.
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 callMore From: International Journal of Computer Integrated Manufacturing
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.
