The two-stage assembly scheduling problem to minimize total completion time with setup times (Q1017445)
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: The two-stage assembly scheduling problem to minimize total completion time with setup times |
scientific article; zbMATH DE number 5554734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two-stage assembly scheduling problem to minimize total completion time with setup times |
scientific article; zbMATH DE number 5554734 |
Statements
The two-stage assembly scheduling problem to minimize total completion time with setup times (English)
0 references
19 May 2009
0 references
scheduling
0 references
assembly flowshop
0 references
total completion time
0 references
heuristic
0 references
dominance relation
0 references
0 references
0 references
0.8708791136741638
0 references
0.8341981172561646
0 references
0.8318595886230469
0 references
0.8233649134635925
0 references
0.8232781291007996
0 references
