A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556): 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/s10951-008-0087-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049813155 / rank | |||
Normal rank | |||
Revision as of 03:13, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem |
scientific article |
Statements
A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (English)
0 references
25 September 2009
0 references
branch and bound algorithms
0 references
scheduling theory and algorithms
0 references
dynamic programming
0 references
