Minimising makespan in the two-machine flow-shop with release times (Q3157644)
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 2130000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimising makespan in the two-machine flow-shop with release times |
scientific article; zbMATH DE number 2130000 |
Statements
Minimising makespan in the two-machine flow-shop with release times (English)
0 references
19 January 2005
0 references
branch and bound
0 references
flow-shop scheduling
0 references
release times
0 references
0.9125587940216064
0 references
0.8668857216835022
0 references
0.8559618592262268
0 references
0.8555007576942444
0 references
0.8481178879737854
0 references
