Scheduling a maintenance activity to minimize total weighted completion-time

Gur Mosheiov*, Assaf Sarig

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

59 Scopus citations

Abstract

We study a single machine scheduling problem. The processor needs to go through a maintenance activity, which has to be completed prior to a given deadline. The objective function is minimum total weighted completion time. The problem is proved to be NP-hard, and an introduction of a pseudo-polynomial dynamic programming algorithm indicates that it is NP-hard in the ordinary sense. We also present an efficient heuristic, which is shown numerically to perform well.

Original languageAmerican English
Pages (from-to)619-623
Number of pages5
JournalComputers and Mathematics with Applications
Volume57
Issue number4
DOIs
StatePublished - Feb 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

  • Dynamic programming
  • Heuristics
  • Maintenance activity
  • Scheduling
  • Single machine
  • Weighted completion time

Fingerprint

Dive into the research topics of 'Scheduling a maintenance activity to minimize total weighted completion-time'. Together they form a unique fingerprint.

Cite this