Sciweavers

Share
COCOON
2005
Springer

On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules

9 years 7 months ago
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneously the Weight (equal to the sum of processing times) and the Size (equal to the number) of the scheduled intervals. We propose a bicriteria algorithm that uses the strategies of two monocriteria algorithms (GOL [7], maximizing the Size and LR [4], maximizing the Weight) and yields two simultaneous constant competitive ratios. This work is an extension of [2] (COCOON’04), where the same model of degradable intervals was investigated in an off-line context and the two objectives were considered separately. In this paper, we consider the problem of scheduling on-line degradable intervals on k identical machines. We define a degradable interval σ by a triplet (r, q, d) where r denotes the release date, q the minimal deadline and d the deadline (r < q ≤ d). This means that σ is scheduled if and only if i...
Fabien Baille, Evripidis Bampis, Christian Lafores
Added 29 Jun 2010
Updated 29 Jun 2010
Type Conference
Year 2005
Where COCOON
Authors Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault
Comments (0)
books