Multiple-machine lower bounds for shop-scheduling problems (Q2884494)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6039045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiple-machine lower bounds for shop-scheduling problems |
scientific article; zbMATH DE number 6039045 |
Statements
30 May 2012
0 references
integer programming
0 references
branch and bound
0 references
Multiple-machine lower bounds for shop-scheduling problems (English)
0 references
0.8261867165565491
0 references
0.8210662603378296
0 references
0.8170895576477051
0 references
0.8089649677276611
0 references
0.8062516450881958
0 references
