Minimizing total tardiness on a two-machine re-entrant flowshop (Q1042154)
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 on a two-machine re-entrant flowshop |
scientific article; zbMATH DE number 5642879
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total tardiness on a two-machine re-entrant flowshop |
scientific article; zbMATH DE number 5642879 |
Statements
Minimizing total tardiness on a two-machine re-entrant flowshop (English)
0 references
7 December 2009
0 references
scheduling
0 references
re-entrant flowshop
0 references
branch and bound
0 references
heuristics
0 references
0 references
0 references
0 references
