On-line algorithms for incompatible job families on parallel machines scheduling with lookahead (Q2993685)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On-line algorithms for incompatible job families on parallel machines scheduling with lookahead |
scientific article; zbMATH DE number 6612269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On-line algorithms for incompatible job families on parallel machines scheduling with lookahead |
scientific article; zbMATH DE number 6612269 |
Statements
10 August 2016
0 references
online scheduling
0 references
parallel batching
0 references
incompatible job families
0 references
makespan
0 references
competitive ratio
0 references
0.9678937196731568
0 references
0.9523923397064208
0 references
0.9248952865600586
0 references
0.8969016671180725
0 references
