New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C57 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C39 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6048075 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
branch and bound algorithms | |||
| Property / zbMATH Keywords: branch and bound algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling theory and algorithms | |||
| Property / zbMATH Keywords: scheduling theory and algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dynamic programming | |||
| Property / zbMATH Keywords: dynamic programming / rank | |||
Normal rank | |||
Revision as of 22:33, 29 June 2023
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
