Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut (Q2835686)
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: Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut |
scientific article; zbMATH DE number 6657819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut |
scientific article; zbMATH DE number 6657819 |
Statements
Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (English)
0 references
30 November 2016
0 references
polyhedral
0 references
valid inequalities
0 references
unrelated parallel machines
0 references
scheduling
0 references
precedence constraints
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0.8183091282844543
0 references
0.8108103275299072
0 references
0.8015339970588684
0 references
0.782924473285675
0 references
0.7782573699951172
0 references
