Online batch scheduling problem on uniform machines with agreeable processing times (Q5234776)
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 7113482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online batch scheduling problem on uniform machines with agreeable processing times |
scientific article; zbMATH DE number 7113482 |
Statements
2 October 2019
0 references
batch scheduling
0 references
online algorithm
0 references
uniform machine
0 references
competitive ratio
0 references
agreeable processing time
0 references
0.8912275433540344
0 references
0.8684597611427307
0 references
0.8649762868881226
0 references
0.8581968545913696
0 references
0.8560279607772827
0 references
