On single-machine scheduling with workload-dependent maintenance duration

Wenchang Luo and Feng Liu

Omega, 2017, vol. 68, issue C, 119-122

Abstract: In this paper, we consider a single-machine scheduling problem with workload-dependent maintenance duration. The objective is to minimize the total weighted completion time. For the case where the maintenance duration is an arbitrarily non-decreasing function on the workload, we propose a (2+ε)-approximation algorithm and a fully polynomial time approximation scheme, which extends the previous results presented by Xu et al. [Single machine total completion time scheduling problem with workload-dependent maintenance duration. Omega 2015;52:101–6].

Keywords: Scheduling; Maintenance; Workload; Approximation scheme (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048316303358
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:68:y:2017:i:c:p:119-122

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.omega.2016.06.008

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().