A note on scheduling parallel machines subject to breakdown and repair

Joseph Y.T. Leung, Michael Pinedo

Research output: Contribution to journalArticlepeer-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, Σ 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.

Original languageEnglish (US)
Pages (from-to)60-71
Number of pages12
JournalNaval Research Logistics
Volume51
Issue number1
DOIs
StatePublished - Feb 1 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

Fingerprint Dive into the research topics of 'A note on scheduling parallel machines subject to breakdown and repair'. Together they form a unique fingerprint.

Cite this