Reactive Scheduling Presentation for an Open Shop problem focused on job's due dates

scheduling consists of assignment resources in order to perform a set of tasks in a given time horizon، that optimizes the usage of available resources. Most of researches in open shop district (area) have stationary and certain status، means the situation that all data are certain and won''t change in time horizon. Whereas real world scheduling problems are rarely stationary and certain. Reactive programming is a researching district that considers and peruses each changes and uncertain assumptions in real world scheduling problems، so in this paper، first we express a mixed integer programming model to produce initial scheduling for open shop problem، in continue we will generalize the presented model to it''s equivalent reactive programming with due date''s changing. Finally we will express an algorithm due to necessity for revise the primal scheduling. This algorithm and whole models have been implemented and ran in AIMMS software environment and the computational results have been reported.