An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families.
Zhao-Hong JiaChao WangJoseph Y.-T. LeungPublished in: Appl. Soft Comput. (2016)
Keyphrases
- makespan minimization
- identical machines
- processing times
- flowshop
- ant colony optimization
- aco algorithm
- polynomial time approximation
- parallel machines
- scheduling problem
- single machine
- metaheuristic
- total weighted tardiness
- polynomially solvable
- aco algorithms
- sequence dependent setup times
- release dates
- tabu search
- setup times
- approximation algorithms
- single machine scheduling problem
- np hard
- special case
- combinatorial optimization problems
- solution quality
- hybrid algorithm
- traveling salesman problem
- ant colony algorithm
- precedence constraints
- error bounds
- resource consumption
- optimization problems
- parameter settings
- production scheduling
- parallel algorithm
- particle swarm optimization
- simulated annealing
- genetic algorithm