Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan
Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan
复制标题
DOI：
10.1016/j.ijpe.2006.08.017
复制
发表时间：
2008-03
影响因子：
12
通讯作者：
H. Allaoui;S. Lamouri;A. Artiba;E. Aghezzaf
中科院分区：
文献类型：
--
作者：
H. Allaoui;S. Lamouri;A. Artiba;E. Aghezzaf
大多数关于两台机器的流水作业问题的论文都假定机器在调度期间总是可用的。然而，在大多数现实生活中的工业环境中，机器可能由于多种原因而不可用。研究了以最小完工时间为目标的两机流水作业联合调度问题和预防性维修问题。我们认为，两台机器中的一台必须在时间表的前T个周期内维护一次。只有不可恢复的情况才被研究。我们首先关注这个问题的特殊性。在给出了最优解的一些性质之后，我们证明了该问题是NP-难的。最后，我们重点研究了在一定条件下的最优解。
Most of the papers that deal with the two-machine flow shop problem assume that the machines are always available during the scheduling period. However, in most real life industrial settings a machine can be unavailable for many reasons. This paper is concerned with the problem of jointly scheduling n immediately available jobs and the preventive maintenance in a two-machine flow shop with the objective of minimizing the makespan. We consider that one of the two machines must be maintained once during the first T periods of the schedule. Only the non-resumable case is studied. We first focus on the particularity of this problem. After we present some properties of the optimal solution then we show that the problem is NP-hard. We last focus on the optimal solutions under some conditions.