Thumbnail

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
2013
Journal name
Discrete Optimization
Volume
10
Number
1
Publisher
Elsevier
Pages
61-68
Publication identifier
Metadata
Show full item record
Author(s)
Kacem, Imed cc
Paschos, Vangelis
Abstract (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 approximability