A note on scheduling parallel machines subject to breakdown and repair

Document Type

Article

Publication Date

2-1-2004

Abstract

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.

Identifier

1142293230 (Scopus)

Publication Title

Naval Research Logistics

External Full Text Location

https://doi.org/10.1002/nav.10105

ISSN

0894069X

First Page

60

Last Page

71

Issue

1

Volume

51

This document is currently not available here.

Share

COinS