New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10589-010-9378-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2068729166 / rank | |||
Normal rank | |||
Revision as of 14:38, 19 March 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
