Single‐machine scheduling and slack due‐date assignment with aging effect and deteriorating maintenance

We consider single‐machine scheduling and slack due‐date assignment problems simultaneously with the position‐dependent aging effect and deteriorating maintenance. In order to counteract the aging effect on the machine, we assume that at most one maintenance is allowed throughout the planning horizon and the maintenance can be performed immediately after the processing of any job is completed. The maintenance duration is dependent on its starting time. The objective is to find jointly the optimal common slack time, the optimal maintenance position, and the optimal schedule such that the sum of the total earliness, the total tardiness, and the common slack time costs is minimized. We propose polynomial time algorithms for all the problems studied.