Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study (Q1651526)
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: Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study |
scientific article; zbMATH DE number 6902761
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study |
scientific article; zbMATH DE number 6902761 |
Statements
Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study (English)
0 references
12 July 2018
0 references
production scheduling
0 references
unrelated parallel batch processors
0 references
\(\varepsilon\)-constraint method
0 references
multi-objective harmony search
0 references
sensitivity analysis
0 references
0 references
0 references
0 references
0 references
0 references
