Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59609614, #quickstatements; #temporary_batch_1707216511891 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Hyperheuristics / rank | |||
Normal rank | |||
Revision as of 16:45, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Handling precedence constraints in scheduling problems by the sequence pair representation |
scientific article |
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
