Minimizing total completion time for re-entrant flow shop scheduling problems (Q650903)
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 completion time for re-entrant flow shop scheduling problems |
scientific article; zbMATH DE number 5986998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total completion time for re-entrant flow shop scheduling problems |
scientific article; zbMATH DE number 5986998 |
Statements
Minimizing total completion time for re-entrant flow shop scheduling problems (English)
0 references
7 December 2011
0 references
re-entrant flow shop scheduling
0 references
total completion time
0 references
heuristic algorithm
0 references
lower bound
0 references
0.8955958485603333
0 references
0.8759012222290039
0 references
0.8729548454284668
0 references
0.8501111268997192
0 references
0.8394837975502014
0 references
