Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights.
Zhao-Hong JiaMing-li PeiJoseph Y.-T. LeungPublished in: Int. J. Syst. Sci. (2017)
Keyphrases
- multi objective
- job processing times
- processing times
- single machine
- release dates
- flowshop
- aco algorithms
- scheduling problem
- completion times
- ant colony optimization
- lot streaming
- weighted sum
- batch processing
- evolutionary algorithm
- multi objective optimization
- scheduling jobs
- optimization algorithm
- conflicting objectives
- single machine scheduling problem
- particle swarm optimization
- genetic algorithm
- quadratic assignment problem
- maximum lateness
- objective function
- pseudo boolean functions
- lower bound
- aco algorithm
- dynamic programming
- np hard
- search algorithm
- parallel machines
- previously reported
- nsga ii
- holding cost
- computational efficiency
- fitness function
- special case
- optimal solution