Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063)
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 7083322
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan |
scientific article; zbMATH DE number 7083322 |
Statements
Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (English)
0 references
19 July 2019
0 references
online scheduling
0 references
uniform parallel-batch machines
0 references
makespan
0 references
competitive ratio
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.97456634
0 references
0.9742438
0 references
0.9650341
0 references
0.9555046
0 references
0.94762576
0 references
0.9475251
0 references
0.9441727
0 references
0.93682927
0 references
0.9287934
0 references
