Annals of Operations Research

, Volume 238, Issue 1–2, pp 199–227 | Cite as

Scheduling on a single machine under time-of-use electricity tariffs

  • Kan Fang
  • Nelson A. Uhan
  • Fu Zhao
  • John W. Sutherland
Article

Abstract

We consider the problem of scheduling jobs on a single machine to minimize the total electricity cost of processing these jobs under time-of-use electricity tariffs. For the uniform-speed case, in which all jobs have arbitrary power demands and must be processed at a single uniform speed, we prove that the non-preemptive version of this problem is inapproximable within a constant factor unless \(\text {P} = \text {NP}\). On the other hand, when all the jobs have the same workload and the electricity prices follow a so-called pyramidal structure, we show that this problem can be solved in polynomial time. For the speed-scalable case, in which jobs can be processed at an arbitrary speed with a trade-off between speed and power demand, we show that the non-preemptive version of the problem is strongly NP-hard. We also present different approximation algorithms for this case, and test the computational performance of these approximation algorithms on randomly generated instances. In addition, for both the uniform-speed and speed-scaling cases, we show how to compute optimal schedules for the preemptive version of the problem in polynomial time.

Keywords

Scheduling Time-of-use tariff Electricity cost  Dynamic speed scaling Approximation algorithm 

References

  1. Albers, S. (2010). Energy-efficient algorithms. Communications of the ACM, 53(5), 86–96.CrossRefGoogle Scholar
  2. Albers, S., & Fujiwara, H. (2007). Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms, 3(4), 49-1–49-17.Google Scholar
  3. Antoniadis, A., & Huang, C. (2013). Non-preemptive speed scaling. Journal of Scheduling, 16(4), 385–394.CrossRefGoogle Scholar
  4. Antoniadis, A., Kling, P., Ott, S., & Riechers, S. (2015). Speed scaling with variable electricity rates and speed limits. In Proceedings of the 12th workshop on models and algorithms for planning and scheduling problems (MAPSP 2015).Google Scholar
  5. Bampis, E., Letsios, D., Milis, I., & Zois, G. (2012). Speed scaling for maximum lateness. In J. Gudmundsson, J. Mestre, & T. Viglas (Eds.), 18th international conference on computing and combinatorics (COCOON 2012), volume 7434 of Lecture Notes in Computer Science, (pp. 25–36). Springer.Google Scholar
  6. Bampis, E., Kononov, A., Letsios, D., Lucarelli, G., & Sviridenko, M. (2013). Energy efficient scheduling and routing via randomized rounding. In A. Seth, & N. K. Vishnoi (Eds.), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), volume 24 of Leibniz International Proceedings in Informatics, (pp. 449–460). Schloss Dagstuhl.Google Scholar
  7. Bampis, E., Kononov, A., Letsios, D., Lucarelli, G., & Nemparis, I. (2015). From preemptive to non-preemptive speed-scaling scheduling. Discrete Applied Mathematics, 181, 11–20.CrossRefGoogle Scholar
  8. Bansal, N., Pruhs, K., & Stein, C. (2007). Speed scaling for weighted flow time. In Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms (SODA07), (pp. 805–813).Google Scholar
  9. Braithwait, S., Hansen, D., & O’Sheasy, M. (2007). Retail electricity pricing and rate design in evolving markets. Technical report, Edison Electric Institute.Google Scholar
  10. Brooks, D. M., Bose, P., Schuster, S. E., Jacobson, H., Kudva, P. N., Buyuktosunoglu, A., et al. (2000). Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors. Micro, IEEE, 20(6), 26–44.CrossRefGoogle Scholar
  11. Castro, P. M., Harjunkoski, I., & Grossmann, I. E. (2009). New continuous-time scheduling formulation for continuous plants under variable electricity cost. Industrial & Engineering Chemistry Research, 48(14), 6701–6714.CrossRefGoogle Scholar
  12. Cohen-Addad, V., Li, Z., Mathieu, C., & Milis, I. (2014). Energy-efficient algorithms for non-preemptive speed-scaling. In Proceedings of the 12th workshop on approximation and online algorithms (WAOA 2014).Google Scholar
  13. Detti, P., Hurkens, C., Agnetis, A., & Ciaschetti, G. (2009). Optimal packet-to-slot assignment in mobile telecommunications. Operations Research Letters, 37(4), 261–264.CrossRefGoogle Scholar
  14. Fang, K., Uhan, N. A., Zhao, F., & Sutherland, J. W. (2011). A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction. Journal of Manufacturing Systems, 30(4), 234–240.CrossRefGoogle Scholar
  15. Fang, K., Uhan, N. A., Zhao, F., & Sutherland, J. W. (2013). Flow shop scheduling with peak power consumption constraints. Annals of Operations Research, 206(1), 115–145.CrossRefGoogle Scholar
  16. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman.Google Scholar
  17. Irani, S., & Pruhs, K. R. (2005). Algorithmic problems in power management. SIGACT News, 36(2), 63–76.CrossRefGoogle Scholar
  18. Kannan, R., & Wei, S. (2006). Approximation algorithms for power-aware scheduling of wireless sensor networks with rate and duty-cycle constraints. In P. B. Gibbons, T. Abdelzaher, J. Aspnes, & R. Rao (Eds.), 2nd IEEE international conference on distributed computing in sensor systems (DCOSS 2006), volume 4026 of Lecture Notes in Computer Science, (pp. 463–479). Springer.Google Scholar
  19. Kulkarni, J., & Munagala, K. (2013). Algorithms for cost-aware scheduling. In T. Erlebach & G. Persiano (Eds.), 10th international workshop on approximation and online algorithms (WAOA 2012), volume 7846 of Lecture Notes in Computer Science, (pp. 201–214). Springer.Google Scholar
  20. Mitra, S., Grossmann, I. E., Pinto, J. M., & Arora, N. (2012). Optimal production planning under time-sensitive electricity prices for continuous power-intensive processes. Computers & Chemical Engineering, 38, 171–184.CrossRefGoogle Scholar
  21. Moon, J.-Y., Shin, K., & Park, J. (2013). Optimization of production scheduling with time-dependent and machine-dependent electricity cost for industrial energy efficiency. International Journal of Advanced Manufacturing Technology, 68(1–4), 523–535.CrossRefGoogle Scholar
  22. Mouzon, G., Yildirim, M. B., & Twomey, J. (2007). Operational methods for minimization of energy consumption of manufacturing equipment. International Journal of Production Research, 45(18–19), 4247–4271.CrossRefGoogle Scholar
  23. Mudge, T. (2001). Power: A first-class architectural design constraint. Computer, 34(4), 52–58.CrossRefGoogle Scholar
  24. Park, C. W., Kwon, K. S., Kim, W. B., Min, B. K., Park, S. J., Sung, I. H., et al. (2009). Energy consumption reduction technology in manufacturing—A selective review of policies, standards, and research. International Journal of Precision Engineering and Manufacturing, 10(5), 151–173.CrossRefGoogle Scholar
  25. Shapiro, S., & Tomain, J. (2005). Rethinking reform of electricity markets. Wake Forest Law Review, 40, 497–543.Google Scholar
  26. Subai, C., Baptiste, P., & Niel, E. (2006). Scheduling issues for environmentally responsible manufacturing: The case of hoist scheduling in an electroplating line. International Journal of Production Economics, 99(1), 74–87.CrossRefGoogle Scholar
  27. Sun, Z., Biller, S., Gu, F., & Li, L. (2011). Energy consumption reduction for sustainable manufacturing systems considering machines with multiple-power states. In ASME 2011 international manufacuring science and engineering conference, Corvallis, Oregon, USA, June 13–17.Google Scholar
  28. Wan, G., & Qi, X. (2010). Scheduling with variable time slot costs. Naval Research Logistics, 57(2), 159–171.Google Scholar
  29. Wang, J., Li, J., & Huang, N. (2009). Optimal scheduling to achieve energy reduction in automotive paint shops. In 2009 ASME manufacturing science and engineering conference, West Lafayette, Indiana, USA, October 4–7.Google Scholar
  30. Yao, F., Demers, A., & Shenker, S. (1995). A scheduling model for reduced CPU energy. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, (pp. 374–382).Google Scholar

Copyright information

© Springer Science+Business Media New York (outside the USA) 2015

Authors and Affiliations

  • Kan Fang
    • 1
  • Nelson A. Uhan
    • 2
  • Fu Zhao
    • 3
  • John W. Sutherland
    • 4
  1. 1.College of Management and EconomicsTianjin UniversityTianjinChina
  2. 2.Mathematics DepartmentUnited States Naval AcademyAnnapolisUSA
  3. 3.Environmental and Ecological Engineering and School of Mechanical EngineeringPurdue UniversityWest LafayetteUSA
  4. 4.Environmental and Ecological EngineeringPurdue UniversityWest LafayetteUSA

Personalised recommendations