A note on scheduling parallel machines subject to breakdown and repair

Joseph Y.T. Leung; Michael Pinedo

doi:10.1002/nav.10105

A note on scheduling parallel machines subject to breakdown and repair

Joseph Y.T. Leung, Michael Pinedo

Computer Science

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

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, Σ C_j, the makespan C_max, and the maximum lateness L_max. 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.

Original language	English (US)
Pages (from-to)	60-71
Number of pages	12
Journal	Naval Research Logistics
Volume	51
Issue number	1
DOIs	https://doi.org/10.1002/nav.10105
State	Published - Feb 2004

All Science Journal Classification (ASJC) codes

Modeling and Simulation
Ocean Engineering
Management Science and Operations Research

Keywords

Makespan
Maximum lateness
Preemption
SPT rule
Total completion time

Access to Document

10.1002/nav.10105

Cite this

@article{60dcbc25aa284c19b9484d2db9aa0712,

title = "A note on scheduling parallel machines subject to breakdown and repair",

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.",

keywords = "Makespan, Maximum lateness, Preemption, SPT rule, Total completion time",

author = "Leung, {Joseph Y.T.} and Michael Pinedo",

year = "2004",

month = feb,

doi = "10.1002/nav.10105",

language = "English (US)",

volume = "51",

pages = "60--71",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley and Sons Inc.",

number = "1",

}

TY - JOUR

T1 - A note on scheduling parallel machines subject to breakdown and repair

AU - Leung, Joseph Y.T.

AU - Pinedo, Michael

PY - 2004/2

Y1 - 2004/2

N2 - 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.

AB - 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.

KW - Makespan

KW - Maximum lateness

KW - Preemption

KW - SPT rule

KW - Total completion time

UR - http://www.scopus.com/inward/record.url?scp=1142293230&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1142293230&partnerID=8YFLogxK

U2 - 10.1002/nav.10105

DO - 10.1002/nav.10105

M3 - Article

AN - SCOPUS:1142293230

SN - 0894-069X

VL - 51

SP - 60

EP - 71

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 1

ER -

A note on scheduling parallel machines subject to breakdown and repair

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this