Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems (Q1304770)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems |
scientific article |
Statements
Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems (English)
0 references
12 February 2002
0 references
branch-and-bound
0 references
scheduling
0 references
