Worst-case bound performance of the preemptive WSPT heuristic for the problem 1, h<sub>1</sub>|pre|&#x003A3;w<sub>i</sub>C<sub>i</sub> - Archive ouverte HAL Access content directly
Conference Papers Year :

Worst-case bound performance of the preemptive WSPT heuristic for the problem 1, h1|pre|ΣwiCi

(1) , (1)
1

Abstract

In this paper we study the single machine scheduling problem, with the aim of minimizing the weighted flowtime. The machine is unavailable during a given period and the preemption of jobs is allowed. We propose new properties of the worst-case performance of the WSPT heuristic. We give a tighter approximation of the worst-case error, and we show that the worst-case bound is equal to 2 under some conditions. The obtained results in this paper improve the previous one proposed by Lee
Not file

Dates and versions

hal-02525626 , version 1 (31-03-2020)

Identifiers

Cite

I. Kacem, Chengbin Chu. Worst-case bound performance of the preemptive WSPT heuristic for the problem 1, h1|pre|ΣwiCi. 2006 International Conference on Service Systems and Service Management, Oct 2006, Troyes, France. pp.1183-1187, ⟨10.1109/ICSSSM.2006.320676⟩. ⟨hal-02525626⟩

Collections

CNRS UTT LOSI
12 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More