Disruption Management For Single Machine Scheduling

Disruption management has risen as popular field in Operations Research and Management Sciences. And disruption management for machine scheduling has been advanced topic in Theory of Scheduling. In the thesis, disruption management of the case when the weighted shortest processing time rule is optimal and single machine with assignable due dates is presented.Our rescheduling is different from solving whole question as a new one from scratch. To make new schedule robust and stable enough, the deviation between original schedule and reschedule became a criteria for optimization.In the first part of the paper, a systematic framework is proposed for machine scheduling. Problems are classified according to the type of disruption, the available reactive policies, and the choice of objective function. With regard to complexity of the disruption management problem, our focus is mainly on disruption management on single machine of which SPT or WSPT rule is applied. Theoretical results are provided for these cases.We summarize and analyze our results. On most occasion, our results can be passed to handle the disruption in the future only to adjust parameters in fix rules. And our rules showed good robustness and stability for tradeoff parameter and disruption, which was also proved by the data experiment. At last we summarize the thesis and gave some recommendation for deeper research.