A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270): Difference between revisions
From MaRDI portal
Latest revision as of 07:31, 7 July 2024
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