Abstract
Scheduling can be divided into two classes, viz. predictive and reactive scheduling. Predictive scheduling addresses problems with deterministic process times and machine availability and generates a solution valid for the entire time span specified. Reactive scheduling, on the other hand, deals with the problem of maintaining schedules in a dynamic environment such as processing delays, machine breakdown, etc. In this paper a review of the research on scheduling in a dynamic environment is presented. Scheduling approaches have been classified into three categories, viz. conventional, knowledge-based and distributed problem solving.
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.
