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

DOI10.1007/s10951-020-00674-3zbMath1479.90105OpenAlexW3119019761MaRDI QIDQ2061134

Tal Raviv, Michal Penn

Publication date: 13 December 2021

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-020-00674-3

zbMATH Keywords

schedulingsingle machinemaximum profitminimum costtime-of-use tariffs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Time-of-use scheduling problem with equal-length jobs ⋮ Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey

Cites Work

• Scheduling on a single machine under time-of-use electricity tariffs
• Energy-efficient scheduling in manufacturing companies: a review and research framework
• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
• Energy-efficient bi-objective single-machine scheduling with power-down mechanism
• On scheduling with non-increasing time slot cost to minimize total weighted completion time
• Scheduling with time-of-use costs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Reducibility among Combinatorial Problems
• Scheduling with variable time slot costs