A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783)
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: A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile |
scientific article; zbMATH DE number 4104702
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile |
scientific article; zbMATH DE number 4104702 |
Statements
A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (English)
0 references
1989
0 references
time complexity
0 references
job precedence graph
0 references
branch-and-bound
0 references
heuristic rules
0 references
0 references
0.8696262
0 references
0.8542549
0 references
0.85394907
0 references
0.8539477
0 references
0.8537687
0 references
0.8532528
0 references
0.8520789
0 references
0.84809625
0 references
