A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10951-009-0154-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025171042 / rank | |||
Normal rank | |||
Revision as of 23:12, 19 March 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
