A note: Simple heuristics for scheduling a maintenance activity on unrelated machines

Gur Mosheiov*, Assaf Sarig

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

Following several recent papers discussing various problems of scheduling a maintenance activity, we focus here on scheduling a maintenance activity on unrelated parallel machines. The objective is to minimize flow-time. In the basic setting, we assume that all the machines must be maintained simultaneously. The problem is known to be NP-hard, and we introduce and test numerically an efficient heuristic and a lower bound, both based on a solution of a matching problem. We also study the relaxed version, where the machines are not restricted to be maintained at the same time. Similar heuristic and lower bound are proposed and tested.

Original languageAmerican English
Pages (from-to)2759-2762
Number of pages4
JournalComputers and Operations Research
Volume36
Issue number10
DOIs
StatePublished - Oct 2009

Bibliographical note

Funding Information:
This paper was supported in part by the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

  • Flow-time
  • Maintenance activity
  • Scheduling
  • Unrelated parallel machines

Fingerprint

Dive into the research topics of 'A note: Simple heuristics for scheduling a maintenance activity on unrelated machines'. Together they form a unique fingerprint.

Cite this