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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theory of computing systems Ročník 65; číslo 6; s. 1009 - 1032
Hlavní autori:	Liu, Fu-Hong, Liu, Hsiang-Hsuan, Wong, Prudence W. H.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2021 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!