Ant colony optimization algorithm to minimize makespan and number of tardy jobs in flexible flowshop systems.
Fabricio Niebles AtencioElyn L. Solano-CharrisJairo R. Montoya-TorresPublished in: CLEI (2012)
Keyphrases
- flowshop
- number of tardy jobs
- ant colony optimization algorithm
- scheduling problem
- processing times
- single machine
- single machine scheduling problem
- bicriteria
- convergence speed
- np hard
- minimizing makespan
- flowshop scheduling
- swarm intelligence
- ant colony optimization
- parallel machines
- dynamic programming
- traveling salesman problem
- tabu search
- upper bound