An Improved ACO with First-job Restriction and P-ANT for Batch Scheduling Problem.
Yang YangZhaohong JiaYiwen ZhangKai LiPublished in: SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI (2019)
Keyphrases
- ant colony optimization
- flowshop
- scheduling problem
- minimizing total tardiness
- dispatching rule
- processing times
- ant colony
- production scheduling
- single machine
- maximum lateness
- swarm intelligence
- ant colonies
- artificial ants
- aco algorithm
- metaheuristic
- batch processing
- identical parallel machines
- job shop
- sequence dependent setup times
- setup times
- traveling salesman problem
- ant colony optimization algorithm
- particle swarm optimization
- pheromone trails
- flexible manufacturing systems
- parallel machine scheduling problem
- minimizing makespan
- nature inspired
- ant colony algorithm
- tabu search
- release dates
- completion times
- genetic algorithm
- single machine scheduling problem
- limited capacity
- scheduling jobs
- parallel machines
- foraging behavior
- total weighted tardiness
- precedence constraints
- np hard
- job processing times
- identical machines
- particle swarm optimization pso
- permutation flowshop
- job search
- ant colony optimisation
- scheduling decisions
- simulated annealing
- job shop scheduling problem
- steady state
- special case
- search algorithm