Scheduling with time-of-use costs

DOI10.1016/j.ejor.2018.11.002zbMath1430.90249OpenAlexW2901569208MaRDI QIDQ1755384

Bo Chen, Xiandong Zhang

Publication date: 9 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/110428/7/WRAP-scheduling-time-use-costs-Chen-2018.pdf

zbMATH Keywords

computational complexityschedulingefficient algorithmpolynomial-time approximation schemetime-of-use cost

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Exact method to optimize the total electricity cost in two-machine permutation flow shop scheduling problem under time-of-use tariff ⋮ Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization ⋮ Exact and heuristic solution approaches for energy-efficient identical parallel machine scheduling with time-of-use costs ⋮ Time-of-use scheduling problem with equal-length jobs ⋮ Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey ⋮ Optimal algorithms for scheduling under time-of-use tariffs ⋮ Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs ⋮ Multi-process production scheduling with variable renewable integration and demand response

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling on a single machine under time-of-use electricity tariffs
• Total completion time with makespan constraint in no-wait flowshops with setup times
• Total completion time minimization on multiple machines subject to machine availability and makespan constraints
• Air cargo revenue management: Characteristics and complexities
• Complexity of single machine, multi-criteria scheduling problems
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• Minimizing makespan subject to minimum total flow-time on identical parallel machines
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• An optimal, dynamic policy for hotel yield management
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
• Multicriteria scheduling
• Revenue Management: Research Overview and Prospects
• Algorithms for Cost-Aware Scheduling
• Stability of service under time-of-use pricing
• Scheduling with variable time slot costs
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Scheduling with time-of-use costs