Scheduling a maintenance activity to minimize total weighted completion-time

Gur Mosheiov; Assaf Sarig

doi:10.1016/j.camwa.2008.11.008

Scheduling a maintenance activity to minimize total weighted completion-time

Gur Mosheiov^*, Assaf Sarig

^*Corresponding author for this work

BA Business Department

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

62 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 language	English
Pages (from-to)	619-623
Number of pages	5
Journal	Computers and Mathematics with Applications
Volume	57
Issue number	4
DOIs	https://doi.org/10.1016/j.camwa.2008.11.008
State	Published - 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

Access to Document

10.1016/j.camwa.2008.11.008

Cite this

@article{a846aa7a5592422397d707905bce1070,

title = "Scheduling a maintenance activity to minimize total weighted completion-time",

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

keywords = "Dynamic programming, Heuristics, Maintenance activity, Scheduling, Single machine, Weighted completion time",

author = "Gur Mosheiov and Assaf Sarig",

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

year = "2009",

month = feb,

doi = "10.1016/j.camwa.2008.11.008",

language = "אנגלית",

volume = "57",

pages = "619--623",

journal = "Computers and Mathematics with Applications",

issn = "0898-1221",

publisher = "Elsevier Ltd.",

number = "4",

}

TY - JOUR

T1 - Scheduling a maintenance activity to minimize total weighted completion-time

AU - Mosheiov, Gur

AU - Sarig, Assaf

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

PY - 2009/2

Y1 - 2009/2

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

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

KW - Dynamic programming

KW - Heuristics

KW - Maintenance activity

KW - Scheduling

KW - Single machine

KW - Weighted completion time

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

U2 - 10.1016/j.camwa.2008.11.008

DO - 10.1016/j.camwa.2008.11.008

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:58349089245

SN - 0898-1221

VL - 57

SP - 619

EP - 623

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

IS - 4

ER -

Scheduling a maintenance activity to minimize total weighted completion-time

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this