Matheuristic Algorithm for Job-Shop Scheduling Problem Using a Disjunctive Mathematical Model.
Eduardo Guzmán OrtizBeatriz AndrésRaul PolerPublished in: Comput. (2022)
Keyphrases
- mathematical model
- job shop scheduling problem
- benchmark problems
- ant colony algorithm
- critical path
- memetic algorithm
- benchmark instances
- cost function
- dynamic programming
- simulated annealing
- worst case
- tabu search
- tabu search algorithm
- control strategy
- feasible solution
- neural network
- scheduling problem
- mathematical models
- k means
- artificial neural networks
- computational complexity
- optimal solution
- job shop scheduling
- objective function
- social networks