Single-machine scheduling with a variable maintenance activity

Wenchang Luo; Edwin Tai Chiu Cheng; Min Ji

doi:10.1016/j.cie.2014.11.002

Single-machine scheduling with a variable maintenance activity

Wenchang Luo
, Edwin Tai Chiu Cheng
, Min Ji

Research output: Journal article publication › Journal article › Academic research › peer-review

64 Citations (Scopus)

Abstract

We consider the problem of scheduling a maintenance activity and jobs on a single machine, where the maintenance activity must start before a given deadline and the maintenance duration increases with its starting time. We provide polynomial-time algorithms to solve the problems to minimize the makespan, sum of completion times, maximum lateness, and number of tardy jobs.

Original language	English
Pages (from-to)	168-174
Number of pages	7
Journal	Computers and Industrial Engineering
Volume	79
DOIs	https://doi.org/10.1016/j.cie.2014.11.002
Publication status	Published - 1 Jan 2015

Keywords

Maintenance
Polynomial-time algorithm
Scheduling
Single machine

ASJC Scopus subject areas

General Computer Science
General Engineering

More information

10.1016/j.cie.2014.11.002

Cite this

@article{8363d1bd7d1949bb8e05ed1f824fbadb,

title = "Single-machine scheduling with a variable maintenance activity",

abstract = "We consider the problem of scheduling a maintenance activity and jobs on a single machine, where the maintenance activity must start before a given deadline and the maintenance duration increases with its starting time. We provide polynomial-time algorithms to solve the problems to minimize the makespan, sum of completion times, maximum lateness, and number of tardy jobs.",

keywords = "Maintenance, Polynomial-time algorithm, Scheduling, Single machine",

author = "Wenchang Luo and Cheng, \{Edwin Tai Chiu\} and Min Ji",

year = "2015",

month = jan,

day = "1",

doi = "10.1016/j.cie.2014.11.002",

language = "English",

volume = "79",

pages = "168--174",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd",

}

TY - JOUR

T1 - Single-machine scheduling with a variable maintenance activity

AU - Luo, Wenchang

AU - Cheng, Edwin Tai Chiu

AU - Ji, Min

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We consider the problem of scheduling a maintenance activity and jobs on a single machine, where the maintenance activity must start before a given deadline and the maintenance duration increases with its starting time. We provide polynomial-time algorithms to solve the problems to minimize the makespan, sum of completion times, maximum lateness, and number of tardy jobs.

AB - We consider the problem of scheduling a maintenance activity and jobs on a single machine, where the maintenance activity must start before a given deadline and the maintenance duration increases with its starting time. We provide polynomial-time algorithms to solve the problems to minimize the makespan, sum of completion times, maximum lateness, and number of tardy jobs.

KW - Maintenance

KW - Polynomial-time algorithm

KW - Scheduling

KW - Single machine

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

U2 - 10.1016/j.cie.2014.11.002

DO - 10.1016/j.cie.2014.11.002

M3 - Journal article

SN - 0360-8352

VL - 79

SP - 168

EP - 174

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

ER -

Single-machine scheduling with a variable maintenance activity

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this