Semi-online scheduling problems on two uniform machines under a grade of service provision (Q388114)
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 6239362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-online scheduling problems on two uniform machines under a grade of service provision |
scientific article; zbMATH DE number 6239362 |
Statements
Semi-online scheduling problems on two uniform machines under a grade of service provision (English)
0 references
19 December 2013
0 references
scheduling
0 references
uniform machine
0 references
grade of service
0 references
semi-online
0 references
competitive ratio
0 references
0.97554654
0 references
0.9723364
0 references
0.9572021
0 references
0.9513285
0 references
0.9340899
0 references
0.92685497
0 references
0.9259228
0 references
0.9258709
0 references
0.9256917
0 references
