A meta-heuristic to solve the just-in-time job-shop scheduling problem.
Mohammad Mahdi AhmadianAmir SalehipourT. C. E. ChengPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- job shop scheduling problem
- metaheuristic
- tabu search
- simulated annealing
- combinatorial optimization problems
- benchmark instances
- job shop scheduling
- combinatorial optimization
- genetic algorithm
- optimization problems
- benchmark problems
- memetic algorithm
- ant colony optimization
- path relinking
- critical path
- optimal solution
- vehicle routing problem
- scheduling problem
- scatter search
- search procedure
- search space
- evolutionary algorithm
- search methods
- heuristic methods
- initial solution
- particle swarm optimization
- feasible solution
- combinatorial problems
- guided local search
- test problems
- mathematical programming
- harmony search algorithm
- genetic algorithm ga
- harmony search
- exact solution
- branch and bound algorithm
- traveling salesman problem
- linear program
- artificial bee colony
- np hard
- multi objective
- search algorithm
- objective function
- neural network