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

We study online scheduling of unit-sized jobs in two related problems, namely, restricted assignment problem and smart grid problem. The input to the two problems are in close analogy but the objective functions are different. We show that the greedy algorithm is an optimal online algorithm for both...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 65; no. 6; pp. 1009 - 1032
Main Authors:	Liu, Fu-Hong, Liu, Hsiang-Hsuan, Wong, Prudence W. H.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2021 Springer Nature B.V
Subjects:	Algorithms Competition Computer aided scheduling Computer Science Greedy algorithms Lower bounds Operations research Optimization Ratios Schedules Smart grid Special Issue on Approximation and Online Algorithms Theory of Computation Restricted assignment Optimal online algorithm Smart grid scheduling
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!