MSPT2 Heuristic and Dynamic Programming Method for the Parallel Machine Scheduling Problem with scheduled Preventive Maintenance

In this paper, we consider the parallel-machine scheduling problem with scheduled maintenance periods to minimize the total (non-weighted and weighted) completion time. For the case of single maintenance period on each machine, we provide an adapted definition of the "SPT" algorithm and we propose an MSPT2 heuristic. For the general case, we present a dynamic programming model to solve optimally the problem. In addition, improved dominance properties are proposed. Experimental simulations are done to evaluate the method performances