Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness

الملخص EN

A single-machine scheduling problem with a mandatory maintenance whose duration is workload-dependent is considered.

The start time of the maintenance is restricted to a time window.

The objective is to determine the start time of the maintenance and schedule all the jobs to the machine such that the maximum lateness is minimized.

An approximation algorithm based on the classical Earliest Due Date first rule is proposed.

It is showed that the proposed algorithm is optimal for some special cases and that it has a tight bound for the scheduling problem under consideration.