Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm.
G. I. ZobolasChristos D. TarantilisGeorge IoannouPublished in: Comput. Oper. Res. (2009)
Keyphrases
- scheduling problem
- flowshop
- minimizing makespan
- np hard
- parallel machines
- computational complexity
- search space
- dynamic programming
- cost function
- job shop scheduling problem
- worst case
- neural network
- tabu search
- strongly np hard
- bicriteria
- precedence constraints
- single machine
- benchmark problems
- hybrid algorithm
- test problems
- metaheuristic
- particle swarm optimization
- scatter search
- special case
- lower bound
- optimal solution