Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption.

In this paper, we study the issue of single-machine rescheduling with linear deteriorating jobs and position-based learning effects simultaneously in response to an unexpected arrival of new jobs. The scheduling efficiency is measured in terms of the makespan, while the cost of disruption is measured in terms of the maximum difference in processing orders of the original jobs before and after disruption. By introducing the effects of deterioration and learning, the job actual processing time is defined by an increasing function of its starting time, meanwhile a decreasing function of its position. Two types of problems are considered. For the first one, the makespan is minimised subject to a limit on the maximum sequence disruption; while in the second one, a linear combination of the makespan and the maximum sequence disruption is minimised. For each problem, the polynomial solvability is demonstrated, and an efficient algorithm is then developed. Finally, extensive computational experiments are conducted to show the efficiency and running behaviours of the proposed algorithms. [ABSTRACT FROM PUBLISHER]