Authors
Joseph Y‐T Leung, Michael Pinedo
Publication date
2004/2
Journal
Naval Research Logistics (NRL)
Volume
51
Issue
1
Pages
60-71
Publisher
Wiley Subscription Services, Inc., A Wiley Company
Description
In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ Cj, the makespan Cmax, and the maximum lateness Lmax. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.
Scholar articles
JYT Leung, M Pinedo - Naval Research Logistics (NRL), 2004