Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691)
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: Handling precedence constraints in scheduling problems by the sequence pair representation |
scientific article; zbMATH DE number 6687844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Handling precedence constraints in scheduling problems by the sequence pair representation |
scientific article; zbMATH DE number 6687844 |
Statements
Handling precedence constraints in scheduling problems by the sequence pair representation (English)
0 references
22 February 2017
0 references
scheduling
0 references
precedence constraints
0 references
sequence pair
0 references
rectangle packing problem
0 references
0 references
0 references
0.7713305950164795
0 references
0.7562444806098938
0 references
0.7324782609939575
0 references
