| Article ID: | iaor20083724 |
| Country: | Singapore |
| Volume: | 24 |
| Issue: | 6 |
| Start Page Number: | 789 |
| End Page Number: | 796 |
| Publication Date: | Dec 2007 |
| Journal: | Asia-Pacific Journal of Operational Research |
| Authors: | Yuan Jinjiang, Li Wenhua, Mu Yundong, Lu Lingfa |
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 single machine with release dates to minimize makespan under a limit on the total sequence disruption can also be solved in polynomial time.