An effective algorithm for flexible assembly job-shop scheduling with tight job constraints.
Wenhui LinQianwang DengWenwu HanGuiliang GongKexin LiPublished in: Int. Trans. Oper. Res. (2022)
Keyphrases
- job shop scheduling
- worst case
- job shop scheduling problem
- computational complexity
- simulated annealing
- objective function
- np hard
- dynamic programming
- similarity measure
- combinatorial optimization
- optimization algorithm
- scheduling problem
- k means
- search space
- optimal solution
- genetic algorithm
- upper bound
- special case
- optimization problems
- lower bound
- search strategy
- knapsack problem
- benchmark problems
- graph model