A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems.
Jérémie Dubois-LacosteManuel López-IbáñezThomas StützlePublished in: Comput. Oper. Res. (2011)
Keyphrases
- scheduling problem
- flowshop
- bi objective
- np hard
- dynamic programming
- ant colony optimization
- strongly np hard
- shortest path problem
- processing times
- optimization algorithm
- computational efficiency
- hybrid algorithm
- worst case
- cost function
- multi objective
- setup times
- particle swarm optimization
- genetic algorithm
- parallel machines
- special case
- job shop
- total weighted tardiness
- objective function