Rescheduling for machine disruption to minimize makespan and maximum lateness
J. Scheduling, pp. 339-352, 2014.
Deterministic schedulingReschedulingDynamic programmingMachine disruption
We consider a scheduling problem where a set of jobs has already been scheduled to minimize some cost objective on a single machine when the machine becomes unavailable for a period of time. The decision-maker needs to reschedule the jobs without excessively disrupting the original schedule. The disruption is measured as the maximum time ...More
Full Text (Upload PDF)
PPT (Upload PPT)