Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs



Wong, Prudence ORCID: 0000-0001-7935-7245
(2021) Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. Theory of Computing Systems.

[img] Text
TOCS.pdf - Accepted Version
Access to this file is embargoed until 8 April 2022.

Download (379kB)
Item Type: Article
Divisions: Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User: Symplectic Admin
Date Deposited: 12 Apr 2021 09:44
Last Modified: 25 Jan 2022 19:31
DOI: 10.1007/s00224-021-10037-w
URI: https://livrepository.liverpool.ac.uk/id/eprint/3119043