Minimizing makespan on a two-machine re-entrant flowshop (Q5428997)
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 5215857
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing makespan on a two-machine re-entrant flowshop |
scientific article; zbMATH DE number 5215857 |
Statements
Minimizing makespan on a two-machine re-entrant flowshop (English)
0 references
29 November 2007
0 references
scheduling
0 references
re-entrant flowshop
0 references
branch and bound, heuristics
0 references
0.95484275
0 references
0.9204695
0 references
0.9195447
0 references
0.91726506
0 references
0.91595095
0 references
0.9121644
0 references
0 references
0.9053924
0 references
