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) .