
Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability
Kacem, Imed; Paschos, Vangelis (2013), Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability, Discrete Optimization, 10, 1, p. 61-68. http://dx.doi.org/10.1016/j.disopt.2012.11.002
View/ Open
Type
Article accepté pour publication ou publiéDate
2013Journal name
Discrete OptimizationVolume
10Number
1Publisher
Elsevier
Pages
61-68
Publication identifier
Metadata
Show full item recordAbstract (EN)
This paper is the first successful attempt on differential approximability study for a scheduling problem. Such a study considers the weighted completion time minimization on a single machine with a fixed non-availability interval. The analysis shows that the Weighted Shortest Processing Time (WSPT) rule cannot yield a differential approximation for the studied problem in the general case. Nevertheless, a slight modification of this rule provides an approximation with a differential ratio of 3−√5 2 ≈ 0.38.Subjects / Keywords
scheduling problem; differential approximabilityRelated items
Showing items related by title and author.
-
Kacem, Imed; Mahjoub, Ali Ridha (2009) Article accepté pour publication ou publié
-
Paschos, Vangelis; Renotte, Laure (1995) Article accepté pour publication ou publié
-
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis; Xiao, Mingyu (2015) Article accepté pour publication ou publié
-
Paschos, Vangelis; Escoffier, Bruno; Monnot, Jérôme (2006) Article accepté pour publication ou publié
-
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis (2005) Communication / Conférence