A branch and price algorithm for single-machine completion time variance (Q2003576)
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 price algorithm for single-machine completion time variance |
scientific article; zbMATH DE number 7077672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and price algorithm for single-machine completion time variance |
scientific article; zbMATH DE number 7077672 |
Statements
A branch and price algorithm for single-machine completion time variance (English)
0 references
9 July 2019
0 references
scheduling
0 references
branch and price
0 references
single machine
0 references
completion time variance
0 references
mixed integer programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.88720995
0 references
0.87805265
0 references
0.8744895
0 references
0.8707249
0 references
0.8704655
0 references
0.8666822
0 references
0.8633895
0 references
0 references
