Bicriteria Scheduling For Contiguous and Non Contiguous Parallel Tasks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Operations Research Année : 2008

Bicriteria Scheduling For Contiguous and Non Contiguous Parallel Tasks

Résumé

We study the problem of scheduling on $k$ identical machines a set of parallel tasks with release dates and deadlines in order to maximize simultaneously two criteria, namely the \emphSize (number of scheduled tasks) and the \emphWeight (sum of the weights of scheduled tasks). If no task requires more than half of the machines, we construct schedules that are simultaneously approximations for the \emphSize and the \emphWeight by combining two approximate schedules, one for each parameter. We obtain existence results and polynomial time bicriteria approximation algorithms in contiguous and non contiguous models.

Dates et versions

hal-00341364 , version 1 (25-11-2008)

Identifiants

Citer

Fabien Baille, Evripidis Bampis, Christian Laforest, Christophe Rapine. Bicriteria Scheduling For Contiguous and Non Contiguous Parallel Tasks. Annals of Operations Research, 2008, 159, pp.97--106. ⟨10.1007/s10479-007-0282-1⟩. ⟨hal-00341364⟩
123 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More