The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293)
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 complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints |
scientific article; zbMATH DE number 7146958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints |
scientific article; zbMATH DE number 7146958 |
Statements
The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (English)
0 references
30 December 2019
0 references
parallel machine scheduling
0 references
level-order
0 references
precedence constraints
0 references
0 references
0 references
0 references
0.9144188
0 references
0 references
0.9114201
0 references
0.90865755
0 references
0.9060726
0 references
0.90332615
0 references
