A branch-and-bound algorithm for uniform machines scheduling problem with in-tree precedence constraints (Q3308052)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7235073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for uniform machines scheduling problem with in-tree precedence constraints |
scientific article; zbMATH DE number 7235073 |
Statements
12 August 2020
0 references
uniform parallel machine scheduling
0 references
in-tree precedence constraint
0 references
branch-and-bound algorithm
0 references
0.8070409297943115
0 references
0.7988908290863037
0 references
0.7968141436576843
0 references
