Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan

H. Allaoui, S. Lamouri, A. Artiba and E. Aghezzaf

International Journal of Production Economics, 2008, vol. 112, issue 1, 161-167

Abstract: 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.

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(07)00135-1
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:112:y:2008:i:1:p:161-167

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().