Minimizing Weighted Mean Completion Time for Malleable Tasks Scheduling
This applet considers malleable tasks of bounded amount of processing resources. The goal is to compute scheduling that minimize the weighted completion time of tasks. The applet generates all possible greedy schedulings for a given instance and displays only the best ones (that are conjectured to be optimal).
- Install Java interface for glpk > wget http://www.labri.fr/~bonichon/malleable/malleable.jar > jar -xf malleable.jar > java -classpath <glpk library> TestGreedyOptimality 5 50 wThe last command line generates 50 random instances composed of 5 tasks and check that the best greedy solutions are optimal. Last remark: this sage worksheet contains some functions that are useful when considering the MWCT of instances that have homogeneous volume and weight and such that delta_i >= P/2.