Solving no-wait job-shop scheduling problems using a multi-start simulated annealing with bi-directional shift timetabling algorithm.
Kuo-Ching YingShih-Wei LinPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- simulated annealing
- bi directional
- job shop scheduling problem
- benchmark problems
- combinatorial optimization
- solution quality
- tabu search
- multi start
- computational complexity
- machine learning
- job shop scheduling
- cost function
- linear programming
- np hard
- optimization algorithm
- convergence rate
- hybrid algorithm
- special case
- scheduling problem
- search procedure
- hill climbing
- objective function
- genetic algorithm
- particle swarm optimization
- path relinking
- stochastic approximation