Article ID Journal Published Year Pages File Type
477775 European Journal of Operational Research 2007 9 Pages PDF
Abstract

In this paper, we consider the rescheduling problem for jobs on a single machine with release dates to minimize makespan under a limit on the maximum sequence disruption. We show that the considered problem can be solved in polynomial time.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
Authors
, ,