A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:49, 2 February 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
