New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-010-9378-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-010-9378-7 / rank | |||
Normal rank | |||
Latest revision as of 17:18, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem |
scientific article |
Statements
New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (English)
0 references
19 June 2012
0 references
branch and bound algorithms
0 references
scheduling theory and algorithms
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
