New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481)
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: New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem |
scientific article; zbMATH DE number 6654214
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem |
scientific article; zbMATH DE number 6654214 |
Statements
New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (English)
0 references
17 November 2016
0 references
flowshop scheduling problem
0 references
permutation flowshop
0 references
total flow-time
0 references
heuristics
0 references
0 references
0 references
0 references
0 references
0 references
0 references
