A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch and bound algorithm to minimize completion time variance on a single processor. |
scientific article; zbMATH DE number 2005373
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm to minimize completion time variance on a single processor. |
scientific article; zbMATH DE number 2005373 |
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
0.9048331
0 references
0.8922077
0 references
0.88720995
0 references
0.88126624
0 references
0.87687016
0 references
0.8762391
0 references
0.8743646
0 references
0.8735521
0 references
