On-Line Simultaneous Mazimization 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 (COCOON04), where the same model of degradable intervals was investigated in an off-line context and the two objectives were considered separately.
Fabien Bailie Evripidis Bampis Christian Laforest Nicolas Thibault
Tour Evry 2, LaMI, Universite dEvry, 523 place des terrasses, 91000 EVRY France
国际会议
The 11th Annual International Computing and Combinatorics Conference COCOON 2005(第11届国际计算和组合会议)
昆明
英文
308-317
2005-08-01（万方平台首次上网日期，不代表论文的发表时间）