You might just need this.
Abstract: Scheduling malleable tasks under general precedence constraints involves finding a minimum makespan (maximum completion time) by a feasible allotment. Based on the monotonous penalty ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results