Scheduling semi-malleable jobs to minimize mean flow time

Abstract : 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) .
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01101783
Contributor : Grégory Mounié <>
Submitted on : Friday, January 9, 2015 - 4:01:55 PM
Last modification on : Thursday, April 4, 2019 - 10:18:05 AM

Identifiers

Collections

INRIA | UGA | LIG

Citation

Yann Hendel, Wieslaw Kubiak, Denis Trystram. Scheduling semi-malleable jobs to minimize mean flow time. Journal of Scheduling, Springer Verlag, 2014, ⟨10.1007/s10951-013-0341-1⟩. ⟨hal-01101783⟩

Share

Metrics

Record views

329