Scheduling a maintenance activity and due‐window assignment based on common flow allowance

We study a due‐window assignment problem on a single machine. The job‐dependent due‐windows are obtained by the common flow allowance criterion. The scheduler has the option to perform a maintenance activity which is rate modifying, i.e., improves the processing times of the following jobs. We consider a number of versions of this setting: (i) The maintenance requires a constant time, (ii) The maintenance duration is an increasing function of its starting time (linear deterioration), and (iii) The maintenance duration is position‐dependent (general deterioration). We study the standard setting of regular job processing times, and investigate also the extension to position‐dependent processing times. The set of potential optimal positions for the maintenance activity is fully characterized. Consequently, the problems based on all the combinations of these settings are shown to be solved in polynomial time.