Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic

摘要

In the paper a power-aware problem of scheduling preemptable jobs on parallel identical machines to minimize the schedule length is considered. Exact approaches utilizing the idea of grouping jobs are presented and compared from the viewpoint of the size of an appropriate non-linear programming problem. (C) 2013 Elsevier B.V. All rights reserved.