Hybrid bat algorithm for flow shop scheduling problems.
Ömür TosunM. K. MarichelvamPublished in: Int. J. Math. Oper. Res. (2016)
Keyphrases
- scheduling problem
- flowshop
- np hard
- computational complexity
- bicriteria
- cost function
- optimal solution
- sequence dependent setup times
- search procedure
- benchmark problems
- list scheduling
- lot streaming
- makespan minimization
- dynamic programming
- single machine scheduling problem
- setup times
- flowshop scheduling problems
- np complete
- minimizing makespan
- strongly np hard
- neural network
- search space
- precedence constraints
- job shop scheduling problem
- simulated annealing
- linear programming
- single machine
- greedy algorithm
- ant colony optimization
- optimization algorithm