Competitive algorithms for demand response management in a smart grid
From MaRDI portal
Recommendations
- Competitive algorithms for demand response management in smart grid
- Optimal nonpreemptive scheduling in a smart grid model
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization
- Online scheduling for electricity cost in smart grid
- Scheduling for electricity cost in a smart grid
Cites work
- Approximation algorithms for scheduling unrelated parallel machines
- Convex programming for scheduling unrelated parallel machines
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- scientific article; zbMATH DE number 7765403 (Why is no real title available?)
- Intrinsic robustness of the price of anarchy
- Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization
- Online scheduling for electricity cost in smart grid
- Optimal nonpreemptive scheduling in a smart grid model
- Scheduling for electricity cost in a smart grid
- Scheduling on a single machine under time-of-use electricity tariffs
This page was built for publication: Competitive algorithms for demand response management in a smart grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6124769)
