On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.orl.2015.07.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ORL.2015.07.008 / rank | |||
Normal rank | |||
Latest revision as of 11:34, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints |
scientific article |
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
