A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q1765532)
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: A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness |
scientific article; zbMATH DE number 2137502
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness |
scientific article; zbMATH DE number 2137502 |
Statements
A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (English)
0 references
23 February 2005
0 references
0 references
0 references
0 references
0.9483279
0 references
0.9114114
0 references
0.9035417
0 references
0 references
0.89539987
0 references
0.8948211
0 references
0.8886138
0 references
0.88650084
0 references
0.88468623
0 references
