New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486)
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: New dominance rules and exploration strategies for the 1|r _i| U _i scheduling problem |
scientific article; zbMATH DE number 6048075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem |
scientific article; zbMATH DE number 6048075 |
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
