Chen, Jian-JiaJian-JiaChenKuo, Tei-WeiTei-WeiKuoLu, Hsueh-IHsueh-ILuTEI-WEI KUO2020-05-042020-05-042005https://scholars.lib.ntu.edu.tw/handle/123456789/490063We study the problem of non-preemptive scheduling to minimize energy consumption for devices that allow dynamic voltage scaling. Specifically, consider a device that can process jobs in a non-preemptive manner. The input consists of (i) the set R of available speeds of the device, (ii) a set J of jobs, and (iii) a precedence constraint ∏ among J. Each job j in J, defined by its arrival time aj, deadline dj, and amount of computation cj, is supposed to be processed by the device at a speed in R. Under the assumption that a higher speed means higher energy consumption, the power-saving scheduling problem is to compute a feasible schedule with speed assignment for the jobs in J such that the required energy consumption is minimized. This paper focuses on the setting of weakly dynamic voltage scaling, i.e., speed change is not allowed in the middle of processing a job. To demonstrate that this restriction on many portable power-aware devices introduces hardness to the power-saving scheduling problem, we prove that the problem is NP-hard even if aj = aj′ and d j = dj′ hold for all j, j′ ε J and |R| = 2. If |R| < ∞, we also give fully polynomial-time approximation schemes for two cases of the general NP-hard problem: (a) all jobs share a common arrival time, and (b) ∏ = θ and for any j, j′ ε J, a j ≤ aj′ implies dj ≤ d j′. To the best of our knowledge, there is no previously known approximation algorithm for any special case of the NP-hard problem. © Springer-Verlag Berlin Heidelberg 2005.[SDGs]SDG7Energy utilization; Polynomials; Problem solving; Scheduling; Set theory; Non-preemptive manners; Speed assignment; Voltage scaling; Electric potentialconference paper10.1007/11534273_30https://doi.org/10.1007/11534273_30