Optimising the job-shop scheduling problem using a multi-objective Jaya algorithm.
Lijun HeWenfeng LiRaymond ChiongMehdi AbediYulian CaoYu ZhangPublished in: Appl. Soft Comput. (2021)
Keyphrases
- job shop scheduling problem
- multi objective
- optimization algorithm
- critical path
- memetic algorithm
- cost function
- simulated annealing
- tabu search
- particle swarm optimization
- benchmark problems
- scheduling problem
- dynamic programming
- np hard
- computational complexity
- optimal solution
- benchmark instances
- job shop scheduling
- genetic programming
- genetic algorithm
- ant colony optimization
- tree structure
- search space
- graph structure
- graph model
- objective function