Section:
New Results
Scheduling semi-malleable jobs to minimize mean flow time
This paper [9] deals with the problem of scheduling malleable and 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 .