On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6945403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints |
scientific article; zbMATH DE number 6945403 |
Statements
On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (English)
0 references
28 September 2018
0 references
online scheduling
0 references
grade of service eligibility
0 references
competitive ratio
0 references
linear programming
0 references
0 references
0 references
0 references
0 references
0.9082278609275818
0 references
0.8575271368026733
0 references
0.8565784096717834
0 references
0.8372642993927002
0 references
0.8359776735305786
0 references
