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

Gur Mosheiov; Assaf Sarig

doi:10.1016/j.cor.2008.12.005

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

Gur Mosheiov^*
, Assaf Sarig

^*Corresponding author for this work

BA Business Department

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	2759-2762
Number of pages	4
Journal	Computers and Operations Research
Volume	36
Issue number	10
DOIs	https://doi.org/10.1016/j.cor.2008.12.005
State	Published - 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

Access to Document

10.1016/j.cor.2008.12.005

Cite this

@article{2a2cca72b4c34bc2852ce8b2d9432b8f,

title = "A note: Simple heuristics for scheduling a maintenance activity on unrelated machines",

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

keywords = "Flow-time, Maintenance activity, Scheduling, Unrelated parallel machines",

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 = oct,

doi = "10.1016/j.cor.2008.12.005",

language = "אנגלית",

volume = "36",

pages = "2759--2762",

journal = "Computers and Operations Research",

issn = "0305-0548",

number = "10",

}

TY - JOUR

T1 - A note

T2 - Simple heuristics for scheduling a maintenance activity on unrelated machines

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/10

Y1 - 2009/10

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

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

KW - Flow-time

KW - Maintenance activity

KW - Scheduling

KW - Unrelated parallel machines

UR - https://www.scopus.com/pages/publications/62549109061

U2 - 10.1016/j.cor.2008.12.005

DO - 10.1016/j.cor.2008.12.005

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

AN - SCOPUS:62549109061

SN - 0305-0548

VL - 36

SP - 2759

EP - 2762

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 10

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this