Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459)
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 the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness |
scientific article; zbMATH DE number 5377418
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness |
scientific article; zbMATH DE number 5377418 |
Statements
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (English)
0 references
4 December 2008
0 references
scheduling
0 references
flowshop
0 references
bicriteria
0 references
multiobjective
0 references
heuristics
0 references
metaheuristics
0 references
genetic algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9007100462913513
0 references
0.8331112861633301
0 references
0.831386148929596
0 references
0.8261975049972534
0 references
