Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-015-9973-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9973-8 / rank | |||
Normal rank | |||
Latest revision as of 20:00, 9 December 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
0 references
0 references
