Scheduling deteriorating jobs under disruption

This paper considers machine scheduling problems with deteriorating jobs under disruption. There are two types of disruption. In the first one we cannot know the disruption in advance and can only start to revise the schedule until the disruption actually occurs. In the second one we can know a disruption is going to occur at some point in the future and can revise the schedule in advance to respond disruption before it occurs. We want to create a new schedule that takes into account both the original objective function and a measure of deviation from the original schedule. The objective is weighted sum of total completion time and total tardiness. We discuss single machine problems and two parallel machine problems. In each case, either a polynomial algorithm or pseudo-polynomial dynamic programming algorithm be provided, respectively.