Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902)
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: Multiprocessor scheduling under precedence constraints: polyhedral results |
scientific article; zbMATH DE number 5021011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiprocessor scheduling under precedence constraints: polyhedral results |
scientific article; zbMATH DE number 5021011 |
Statements
Multiprocessor scheduling under precedence constraints: polyhedral results (English)
0 references
28 April 2006
0 references
Polyhedral combinatorics
0 references
Valid inequalities
0 references
Order polytopes
0 references
Scheduling
0 references
Multiprocessors
0 references
Precedence constraints
0 references
0 references
0.8437606692314148
0 references
0.8342520594596863
0 references
0.8179872632026672
0 references
0.8052590489387512
0 references
