Exact algorithms for single-machine scheduling problems with a variable maintenance

• We deal with single-machine scheduling problems (SMSPs) with a variable machine maintenance.
• The four SMSPs have different objectives.
• We propose polynomial-time exact algorithms for the four SMSPs.

This paper deals with four single-machine scheduling problems (SMSPs) with a variable machine maintenance. The objectives of the four SMSPs are to minimize mean lateness, maximum tardiness, total flow time and mean tardiness, respectively. These four SMSPs are important in the literature and in practice. This study proposes an exact algorithm with the computational complexity O(n2)O(n2) for each of the four SMSPs. In addition to the given jobs, the machine maintenance activity between two consecutive jobs is optimally scheduled.