Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808): 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/s10878-012-9545-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2294497340 / rank | |||
Normal rank | |||
Revision as of 21:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms with limited number of preemptions for scheduling on parallel machines |
scientific article |
Statements
Algorithms with limited number of preemptions for scheduling on parallel machines (English)
0 references
24 June 2014
0 references
\(i\)-preemptive scheduling
0 references
approximation algorithm
0 references
worst case ratio
0 references
makespan
0 references
