Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
We consider the problem of unrelated parallel machine scheduling when the DVS (dynamic voltage scaling) method is used to conserve energy consumption. Given an energy budget, we present (2 + ε)-approximation algorithms for the makespan minimization problem under two different settings, the continuous model in which speeds are allowed to be any real number in [s min ,s max ] and the discrete model in which only d distinct speeds are available. We also show how to derive a 2-approximation algorithm if the energy budget is allowed to be slightly exceeded.
KeywordsApproximation algorithm Unrelated machine scheduling Rounding
Unable to display preview. Download preview PDF.
- 1.Albers, S., Muller, F., Schmelzer, S.: Speed scaling on parallel processors. In: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 289–298 (2007)Google Scholar
- 9.Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 374–382 (1995)Google Scholar
- 11.Yu, L., Shih, H., Pfund, M.E., Carlyle, W.M., Fowler, J.W.: Scheduling of unrelated parallel-machines: An application to PWB manufacturing. IIE Transactions on Scheduling and Logistics 34, 921–931 (2002)Google Scholar