Using Ant Colony Optimization to minimize the Fuzzy makespan and Total Weighted Fuzzy Completion Time in Flow Shop Scheduling Problems.
Peng-Jen LaiHsien-Chung WuPublished in: Int. J. Uncertain. Fuzziness Knowl. Based Syst. (2009)
Keyphrases
- flowshop
- ant colony optimization
- job processing times
- completion times
- scheduling problem
- metaheuristic
- makespan minimization
- processing times
- swarm intelligence
- sequence dependent setup times
- ant colony
- maximum lateness
- ant colony algorithm
- combinatorial optimization problems
- traveling salesman problem
- particle swarm optimization
- setup times
- minimizing makespan
- single machine
- open shop
- tabu search
- ant colonies
- particle swarm optimization pso
- aco algorithm
- total weighted tardiness
- np hard
- aco algorithms
- genetic algorithm
- lot streaming
- parallel machines
- special case
- flowshop scheduling problems
- optimal solution
- permutation flowshop
- job shop
- release dates
- hybrid algorithm
- scheduling jobs
- strongly np hard
- unrelated parallel machines
- artificial immune system
- evolutionary algorithm