A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm to minimize completion time variance on a single processor. |
scientific article |
Statements
A branch and bound algorithm to minimize completion time variance on a single processor. (English)
0 references
17 November 2003
0 references
Single machine scheduling
0 references
Completion time variance
0 references
Lower bound
0 references
Branch and bound
0 references
0 references
