The solvable cases of a scheduling algorithm (Q2872088)
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: The solvable cases of a scheduling algorithm |
scientific article; zbMATH DE number 6245133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The solvable cases of a scheduling algorithm |
scientific article; zbMATH DE number 6245133 |
Statements
The Solvable Cases of a Scheduling Algorithm (English)
0 references
14 January 2014
0 references
scheduling theory
0 references
solvable cases
0 references
precedence constraints
0 references
identical parallel machines
0 references
preemptions
0 references
maximum lateness
0 references
0.8139675855636597
0 references
0.801581621170044
0 references
0.8006991147994995
0 references
0.8005136847496033
0 references
0.8003302812576294
0 references
