Skip to main content
Springer Nature Link
Log in

Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

Following a recent interest in sustainable scheduling under operational costs that vary over time, we study scheduling problems on a single machine under time-of-use electricity tariffs. We consider two main variants of the problem: cost minimization and profit maximization. In the cost minimization problem, the set of jobs to be processed is given, and the goal is to schedule all jobs within a planning horizon so as to minimize the total cost, while in the profit maximization problem, one needs to select a set of jobs to be processed such that the total profit is maximized. The general cases of the cost minimization and profit maximization problems in which preemptions are forbidden are strongly NP-hard. In this paper, we show that some special cases with identical processing times can be solved by efficient algorithms. In addition, we consider several extensions of the problems, including release times, due dates, and variable energy consumption.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Aghelinejad, M., Ouazene, Y., & Yalaoui, A. (2019). Complexity analysis of energy-efficient single machine scheduling problems. Operations Research Perspectives, 6, 100105.

    Article  Google Scholar 

  • Brenner, U. (2008). A faster polynomial algorithm for the unbalanced Hitchcock transportation problem. Operations Research Letters, 36, 408–413.

    Article  Google Scholar 

  • Che, A., Wu, X., Peng, J., & Yan, P. (2017). Energy-efficient bi-objective single-machine scheduling with power-down mechanism. Computers & Operations Research, 85, 172–183.

    Article  Google Scholar 

  • Che, A., Zeng, Y., & Lyu, K. (2016). An efficient greedy insertion heuristic for energy-conscious single machine scheduling problem under time-of-use electricity tariffs. Journal of Cleaner Production, 129, 565–577.

    Article  Google Scholar 

  • Chen, B., & Zhang, X. (2019). Scheduling with time-of-use costs. European Journal of Operational Research, 274(3), 900–908.

    Article  Google Scholar 

  • Fang, K. (2013). Algorithmic and mathematical programming approaches to scheduling problems with energy-based objectives, Ph.D. dissertation, Purdue University, ProQuest Dissertations Publishing, 2013. 3613120.

  • Fang, K., Uhan, N. A., Zhao, F., & Sutherland, J. W. (2016). Scheduling on a single machine under time-of-use electricity tariffs. Annals of Operations Research, 238(1–2), 199–227.

    Article  Google Scholar 

  • Gahm, C., Denz, F., Dirr, M., & Tuma, A. (2016). Energy-efficient scheduling in manufacturing companies: A review and research framework. European Journal of Operational Research, 248(3), 744–757.

    Article  Google Scholar 

  • Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 3, 287–326.

    Article  Google Scholar 

  • Karp, R. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85–103). NY: Plenum Press.

    Chapter  Google Scholar 

  • Rubaiee, S., Cinar, S., & Yildirim, M. B. (2018). An energy-aware multiobjective optimization framework to minimize total tardiness and energy cost on a single-machine nonpreemptive scheduling. IEEE Transactions on Engineering Management (Early access).

  • Shrouf, F., Ordieres-Meré, J., García-Sánchez, A., & Ortega-Mier, M. (2014). Optimizing the production scheduling of a single machine to minimize total energy consumption costs. Journal of Cleaner Production, 67, 197–207.

    Article  Google Scholar 

  • Wan, G., & Qi, X. (2010). Scheduling with variable time slot costs. Naval Research Logistics, 57, 159–171.

    Article  Google Scholar 

  • Zhao, Y., Qi, X., & Minming, L. (2016). On scheduling with non-increasing time slot cost to minimize total weighted completion time. Journal of Scheduling, 19, 759–767.

    Article  Google Scholar 

  • Zhong, W., & Liu, X. (2012). A single machine scheduling problem with time slot costs. Recent advances in computer science and information engineering (pp. 678–681). Heidelberg: Springer.

    Google Scholar 

Download references

Acknowledgements

The authors wish to express their thanks to the anonymous reviewers for their constructive remarks.

Author information

Authors and Affiliations

  1. Technion, Haifa, Israel

    Michal Penn

  2. Tel Aviv University, Tel Aviv, Israel

    Tal Raviv

Authors
  1. Michal Penn
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Tal Raviv
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Tal Raviv.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Penn, M., Raviv, T. Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs. J Sched 24, 83–102 (2021). https://doi.org/10.1007/s10951-020-00674-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-020-00674-3

Keywords