YUAN, JINJIANG; MU, YUNDONG; LU, LINGFA; LI, WENHUA - In: Asia-Pacific Journal of Operational Research (APJOR) 24 (2007) 06, pp. 789-796
In this paper, we consider the rescheduling problem for jobs on a single machine with release dates to minimize total sequence disruption under a limit on the makespan. We show that the considered problem can be solved in polynomial time. Consequently, the rescheduling problem for jobs on a...
