A best possible on-line algorithm for scheduling on uniform parallel-batch machines (Q1637343)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A best possible on-line algorithm for scheduling on uniform parallel-batch machines |
scientific article; zbMATH DE number 6882316
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best possible on-line algorithm for scheduling on uniform parallel-batch machines |
scientific article; zbMATH DE number 6882316 |
Statements
A best possible on-line algorithm for scheduling on uniform parallel-batch machines (English)
0 references
8 June 2018
0 references
online algorithm
0 references
uniform machines
0 references
parallel-batch machines
0 references
makespan
0 references
competitive ratio
0 references
0 references
0 references
