The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207)
From MaRDI portal
!
WARNING
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 6467055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies |
scientific article; zbMATH DE number 6467055 |
Statements
The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (English)
0 references
29 July 2015
0 references
scheduling
0 references
two-machine flowshop
0 references
sequence-independent setup times
0 references
total completion time
0 references
lower bounds
0 references
Lagrangian relaxation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9116966724395752
0 references
0.8642719984054565
0 references
0.8586962223052979
0 references
0.8544554710388184
0 references
0.8470236659049988
0 references
