作者
H Allaoui, S Lamouri, A Artiba, E Aghezzaf
发表日期
2008/3/1
期刊
International Journal of Production Economics
卷号
112
期号
1
页码范围
161-167
出版商
Elsevier
简介
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.
学术搜索中的文章
H Allaoui, S Lamouri, A Artiba, E Aghezzaf - International Journal of Production Economics, 2008