Online early work maximization problem on two hierarchical machines with buffer or rearrangements (Q6167006)
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 7708514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online early work maximization problem on two hierarchical machines with buffer or rearrangements |
scientific article; zbMATH DE number 7708514 |
Statements
Online early work maximization problem on two hierarchical machines with buffer or rearrangements (English)
0 references
7 July 2023
0 references
semi-online
0 references
early work
0 references
competitive ratio
0 references
two machines
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8905272483825684
0 references
0.8738060593605042
0 references
0.8722634315490723
0 references
0.8684760332107544
0 references
