A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251): 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-010-0172-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062953948 / rank | |||
Normal rank | |||
Revision as of 03:14, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan |
scientific article |
Statements
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (English)
0 references
16 January 2012
0 references
parallel-batch scheduling
0 references
online algorithm
0 references
restart
0 references
competitive ratio
0 references
