Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
From MaRDI portal
Publication:5919098
DOI10.1007/s00224-021-10037-wOpenAlexW3154943043MaRDI QIDQ5919098
Prudence W. H. Wong, Hsiang-Hsuan Liu, Fu-Hong Liu
Publication date: 28 September 2021
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-021-10037-w
Algorithms in computer science (68Wxx) Computer system organization (68Mxx) Operations research and management science (90Bxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast approximation algorithms for job scheduling with processing set restrictions
- On the configuration-LP for scheduling on unrelated machines
- Tight bounds for selfish and greedy load balancing
- Approximation algorithms for scheduling unrelated parallel machines
- New algorithms for an ancient scheduling problem.
- A note on graph balancing problems with restrictions
- On-line load balancing
- Scheduling for electricity cost in a smart grid
- The 2-valued case of makespan minimization with assignment constraints
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization
- Parallel machine scheduling with nested job assignment restrictions
- Competitive algorithms for demand response management in smart grid
- Graph balancing: a special case of scheduling unrelated parallel machines
- On some special cases of the restricted assignment problem
- On-Line Load Balancing of Temporary Tasks
- The Competitiveness of On-Line Assignments
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Optimal Nonpreemptive Scheduling in a Smart Grid Model
- Santa Claus Schedules Jobs on Unrelated Machines
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Online Scheduling for Electricity Cost in Smart Grid
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
- On-line load balancing of temporary tasks revisited
