Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability - Université de Lorraine Access content directly
Journal Articles Discrete Optimization Year : 2013

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.

Dates and versions

hal-01267631 , version 1 (04-02-2016)

Identifiers

Cite

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

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More