Parallel machines scheduling with machine maintenance for minsum criteria

Zhiyi Tan, Yong Chen and An Zhang

European Journal of Operational Research, 2011, vol. 212, issue 2, 287-292

Abstract: This paper considers a parallel-machine scheduling problem with machine maintenance. There are unavailable periods on each of the first k machines, and the remaining m - k machines are always available, where 1 [less-than-or-equals, slant] k [less-than-or-equals, slant] m is an integer. The objective is to minimize the total completion time of all jobs. We show the classical SPT algorithm has a worst-case ratio of at most when kÂ

Keywords: Scheduling; Machine; maintenance; Approximation; algorithm; Worst-case; analysis (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(11)00137-8
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:ejores:v:212:y:2011:i:2:p:287-292

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().