Solving a Bi-objective Flowshop Scheduling Problem by Pareto-Ant Colony Optimization.
Joseph M. PasiaRichard F. HartlKarl DoernerPublished in: ANTS Workshop (2006)
Keyphrases
- ant colony optimization
- bi objective
- flowshop
- scheduling problem
- metaheuristic
- swarm intelligence
- multi objective
- processing times
- traveling salesman problem
- flowshop scheduling
- genetic algorithm
- minimizing makespan
- aco algorithm
- combinatorial optimization problems
- sequence dependent setup times
- particle swarm optimization
- setup times
- strongly np hard
- maximum lateness
- tabu search
- multi objective optimization
- nature inspired
- multiobjective optimization
- minimizing total tardiness
- single machine
- total tardiness
- np hard
- special case
- particle swarm optimization pso
- combinatorial optimization
- hybrid algorithm
- multiple objectives
- precedence constraints
- completion times
- differential evolution
- parallel machines
- cost function
- neural network
- lower bound
- permutation flowshop
- preventive maintenance
- variable neighborhood search
- efficient solutions
- job shop scheduling problem