Scheduling a deteriorating maintenance activity on a single machine

被引：97

作者：

Mosheiov, G. ^{[1
]}

Sidney, J. B. ^{[2
]}

机构：

[1] Hebrew Univ Jerusalem, Sch Business Adm, IL-91905 Jerusalem, Israel

[2] Univ Ottawa, Ottawa, ON, Canada

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2010年 / 61卷 / 05期

基金：

加拿大自然科学与工程研究理事会;

关键词：

scheduling; single-machine; maintenance activity; polynomial-time solution; ASSIGNMENT;

D O I：

10.1057/jors.2009.5

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We study a problem of scheduling a maintenance activity on a single machine. Following several recent papers, the maintenance is assumed to be deteriorating, that is, delaying the maintenance increases the time required to perform it. The following objective functions are considered: makespan, flowtime, maximum lateness, total earliness, tardiness and due-date cost, and number of tardy jobs. We introduce polynomial time solutions for all these problems. Journal of the Operational Research Society (2010) 61, 882-887. doi:10.1057/jors.2009.5

引用

页码：882 / 887

页数：6

共 10 条

[1]

[Anonymous], EUR J OPL RES

[2] A concise survey of scheduling with time-dependent processing times [J].

Cheng, TCE ;

Ding, Q ;

Lin, BMT .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 152 (01) :1-13

[3] Planning machine maintenance in two-machine shop scheduling [J].

Kubzin, M. A. ;

Strusevich, V. A. .

OPERATIONS RESEARCH, 2006, 54 (04) :789-800

[4] The Hungarian Method for the assignment problem [J].

Kuhn, HW .

NAVAL RESEARCH LOGISTICS, 2005, 52 (01) :7-21

[5]

Lee CY, 2000, NAV RES LOG, V47, P145, DOI 10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO

[6]

2-3

[7]

Lee H.Y., 2005, Journal of Ethnic Cultural Diversity in Social Work, V13, P1, DOI DOI 10.1300/J051V13N04_01

[8] N JOB, ONE MACHINE SEQUENCING ALGORITHM FOR MINIMIZING THE NUMBER OF LATE JOBS [J].

MOORE, JM .

MANAGEMENT SCIENCE, 1968, 15 (01) :102-109

[9]

Mosheiov G, 2003, INFOR, V41, P155

[10] COMMON DUE DATE ASSIGNMENT TO MINIMIZE TOTAL PENALTY FOR THE ONE MACHINE SCHEDULING PROBLEM [J].

PANWALKAR, SS ;

SMITH, ML ;

SEIDMANN, A .

OPERATIONS RESEARCH, 1982, 30 (02) :391-399

← 1 →