The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime (Q1869720)
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- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime |
scientific article; zbMATH DE number 1902814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime |
scientific article; zbMATH DE number 1902814 |
Statements
The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime (English)
0 references
28 April 2003
0 references
Flowshop
0 references
bicriteria
0 references
makespan
0 references
mean flowtime
0 references
heuristics
0 references
dominance
0 references
relation
0 references
0 references
0 references
0 references
0 references
0.9098984599113464
0 references
0.8820722103118896
0 references
0.881111741065979
0 references
0.8712971806526184
0 references
0.8644945025444031
0 references
