May 10, 2015 · In this paper, we show that the use of convex cost flow computations may lead to polynomial-time algorithms for basic speed-scaling scheduling problems.
We also propose a polynomial-time algorithm for minimizing a linear combination of the sum of the completion times of the jobs and the total energy consumption, ...
Instead of using convex cost flows, our algorithm is based on the computation of a minimum weighted maximum matching in an appropriate bipartite graph. Mots ...
Apr 18, 2015 · Abstract. Recently, optimal combinatorial algorithms have been presented for the energy minimization multiprocessor speed-scaling problem ...
In this paper, we show that both the algorithms and their analysis can be greatly simplified. In order to do this, we formulate the problem as a convex cost ...
Instead of using convex cost flows, our algorithm is based on the computation of a minimum weighted maximum matching in an appropriate bipartite graph.
Consequently, green scheduling has become a research hot spot and has been widely used in many production systems, such as convex cost flow [4] , parallel ...
People also ask
What is green scheduling?
What is flow time in scheduling?
Green scheduling may be considered one of the principles of green manufacturing, aimed at minimizing environmental damage and energy waste.
Green scheduling, flows and matchings. E Bampis, D Letsios, G Lucarelli. Theoretical Computer Science 579, 126-136, 2015. 44, 2015 ; From preemptive to non- ...
supply set points for constant individual flow or by adjusting individual flows for identical set points. Figure 3 shows a detailed view of a single chiller ...