Rescheduling Problems with Agreeable Job Parameters to Minimize the Tardiness Costs under Deterioration and Disruption

Abstract EN

This paper considers single-machine rescheduling problems with agreeable job parameters under deterioration and disruption.

Deteriorating jobs mean that the processing time of a job is defined by an increasing function of its starting time.

Rescheduling means that, after a set of original jobs has already been scheduled, a new set of jobs arrives and creates a disruption.

We consider four cases of minimization of the total tardiness costs with agreeable job parameters under a limit of the disruptions from the original job sequence.

We propose polynomial-time algorithms or some dynamic programming algorithms under sequence disruption and time disruption.