Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights (Q4600100)
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: Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights |
scientific article; zbMATH DE number 6822706
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights |
scientific article; zbMATH DE number 6822706 |
Statements
Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights (English)
0 references
5 January 2018
0 references
multi-objective optimisation
0 references
ant colony optimisation
0 references
batch-processing machines
0 references
makespan
0 references
rejection cost
0 references
