Abstract

This paper deals with a new reactive scheduling strategy, which is referred to as match-up strategy, with a buffered predictive schedule aiming at reducing overreaction to disruptions which occur during the schedule execution. Buffers allocated on the predictive schedule over time play a role of absorption of schedule delays, by which it is expected to control frequent schedule modification. Some computational experiments demonstrate the applicablity of the proposed strategy under parallel machine environment.

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.