Competitive algorithms for demand response management in a smart grid

DOI10.1007/s10951-021-00690-xOpenAlexW4246147767MaRDI QIDQ6124769

Nguyen Kim Thang, Vincent Chau, Shengzhong Feng

Publication date: 2 April 2024

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

Full work available at URL: https://doi.org/10.1007/s10951-021-00690-x

zbMATH Keywords

schedulingapproximation algorithmsmart grid

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling on a single machine under time-of-use electricity tariffs
• Approximation algorithms for scheduling unrelated parallel machines
• Scheduling for electricity cost in a smart grid
• Non-preemptive scheduling in a smart grid model and its implications on machine minimization
• Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
• Intrinsic Robustness of the Price of Anarchy
• Convex programming for scheduling unrelated parallel machines
• Optimal Nonpreemptive Scheduling in a Smart Grid Model
• Online Scheduling for Electricity Cost in Smart Grid
• Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs

This page was built for publication: Competitive algorithms for demand response management in a smart grid