Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (Q337017)
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: Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times |
scientific article; zbMATH DE number 6650665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times |
scientific article; zbMATH DE number 6650665 |
Statements
Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (English)
0 references
10 November 2016
0 references
scheduling
0 references
re-entrant flowshop
0 references
sequence-dependent setup times
0 references
branch and bound
0 references
heuristics
0 references
0 references
0 references
0.9349926710128784
0 references
0.8896852731704712
0 references
0.836743950843811
0 references
0.8358333706855774
0 references
0.8324320316314697
0 references
