Minimizing total tardiness in a single machine scheduling problem with periodically scheduled maintenance

Abstract

This research considers a single machine scheduling problem in which the machine is supposed to be stopped periodically to perform maintenance. The objective is to minimize total tardiness of all jobs which are non-resumable. To deal with the problem, a mathematical formulation is developed to find optimal solutions. In addition, two-phase heuristic algorithms which are based on Tabu Search and Simulated Annealing are derived to obtain near optimal solutions. In the heuristics, multi initialization strategy (MI) to enhance the search effectiveness is used. Computational experiments are performed to evaluate the efficiency of the formulation and the heuristics.