Skip to Main content Skip to Navigation
Journal articles

Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability

Abstract : 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 problem under consideration in the general case. Nevertheless, a slight modification of this rule provides an approximation with a differential ratio of 3-root 5/2 approximate to 0.38.
Document type :
Journal articles
Complete list of metadatas

https://hal.univ-lorraine.fr/hal-01267631
Contributor : Catherine Angevelle <>
Submitted on : Thursday, February 4, 2016 - 4:10:13 PM
Last modification on : Wednesday, September 23, 2020 - 4:28:19 AM

Links full text

Identifiers

Citation

Imed Kacem, Vangelis Th. Paschos. Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. Discrete Optimization, Elsevier, 2013, 10 (1), pp.61-68. ⟨10.1016/j.disopt.2012.11.002⟩. ⟨hal-01267631⟩

Share

Metrics

Record views

145