Scheduling a maintenance activity on parallel identical machines

Asaf Levin, Gur Mosheiov*, Assaf Sarig

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

26 Scopus citations

Abstract

We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required electricity shut-down. The objective is minimum flow-time. The problem is shown to be NP-hard, and moreover impossible to approximate unless P = NP. We introduce a pseudo-polynomial dynamic programming algorithm, and show how to convert it into a bicriteria FPTAS for this problem. We also present an efficient heuristic and a lower bound. Our numerical tests indicate that the heuristic provides in most cases very close-to-optimal schedules.

Original languageAmerican English
Pages (from-to)33-41
Number of pages9
JournalNaval Research Logistics
Volume56
Issue number1
DOIs
StatePublished - Feb 2009

Keywords

  • Flow-time
  • Maintenance activity
  • Parallel machines
  • Scheduling

Fingerprint

Dive into the research topics of 'Scheduling a maintenance activity on parallel identical machines'. Together they form a unique fingerprint.

Cite this