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

Michal Penn and Tal Raviv ()
Additional contact information
Michal Penn: Technion
Tal Raviv: Tel Aviv University

Journal of Scheduling, 2021, vol. 24, issue 1, No 7, 83-102

Abstract: 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.

Keywords: Scheduling; Time-of-use tariffs; Single machine; Maximum profit; Minimum cost (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-020-00674-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:24:y:2021:i:1:d:10.1007_s10951-020-00674-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-020-00674-3

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().