Article ID: | iaor20113861 |
Volume: | 60 |
Issue: | 4 |
Start Page Number: | 602 |
End Page Number: | 605 |
Publication Date: | May 2011 |
Journal: | Computers & Industrial Engineering |
Authors: | Yang Dar-Li, Hsu Chou-Jung, Cheng T C E |
Keywords: | maintenance, repair & replacement |
We study the problem of unrelated parallel‐machine scheduling with deteriorating maintenance activities. Each machine has at most one maintenance activity, which can be performed at any time throughout the planning horizon. The length of the maintenance activity increases linearly with its starting time. The objective is to minimize the total completion time or the total machine load. We show that both versions of the problem can be optimally solved in polynomial time.