A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270)
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 deterministic on-line algorithm for minimizing makespan on parallel batch machines |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines |
scientific article |
Statements
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (English)
0 references
5 February 2014
0 references
scheduling
0 references
parallel batch machines
0 references
on-line
0 references
0 references
0 references
0 references
