Scheduling jobs and maintenance activities on parallel machines.

*(English)* Zbl 0973.90034
Summary: Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of $n$ jobs on $m$ parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most $j$ machines, $1\le j\le m$, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper.

##### MSC:

90B35 | Scheduling theory, deterministic |

90B25 | Reliability, availability, maintenance, inspection, etc. (optimization) |