| Article ID: | iaor201529121 |
| Volume: | 66 |
| Issue: | 11 |
| Start Page Number: | 1906 |
| End Page Number: | 1918 |
| Publication Date: | Nov 2015 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Lee Wen-Chiung, Wang Jen-Ya, Lee Lin-Yo |
| Keywords: | scheduling, maintenance, repair & replacement, combinatorial optimization, programming: branch and bound, heuristics: genetic algorithms |
The scheduling of maintenance activities has been extensively studied, with most studies focusing on single‐machine problems. In real‐world applications, however, multiple machines or assembly lines process numerous jobs simultaneously. In this paper, we study a parallel‐machine scheduling problem in which the objective is to minimize the total tardiness given that there is a maintenance activity on each machine. We develop a branch‐and‐bound algorithm to solve the problem with a small problem size. In addition, we propose a hybrid genetic algorithm to obtain the approximate solutions when the number of jobs is large. The performance of the proposed algorithms is evaluated based mainly on computational results.