Scheduling semi-malleable jobs to minimize mean flow time - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Scheduling Année : 2014

Scheduling semi-malleable jobs to minimize mean flow time

Résumé

This paper deals with the problem of scheduling nA malleable and nB non-malleable jobs to be executed together on two parallel identical machines to minimize mean flow time. We propose a set of dominant schedules for this problem, and a dynamic programming algorithm that finds an optimal schedule in this dominant set in time O(n2AnB) .
Fichier non déposé

Dates et versions

hal-01101783 , version 1 (09-01-2015)

Identifiants

Citer

Yann Hendel, Wieslaw Kubiak, Denis Trystram. Scheduling semi-malleable jobs to minimize mean flow time. Journal of Scheduling, 2014, ⟨10.1007/s10951-013-0341-1⟩. ⟨hal-01101783⟩
176 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More