A novel dynamic assignment rule for the distributed job shop scheduling problem using a hybrid ant-based algorithm.
Imen ChaouchOlfa Belkahla DrissKhaled GhédiraPublished in: Appl. Intell. (2019)
Keyphrases
- job shop scheduling problem
- benchmark problems
- critical path
- optimization algorithm
- probabilistic model
- job shop scheduling
- memetic algorithm
- simulated annealing
- particle swarm optimization
- production scheduling
- social networks
- dynamic programming
- ant colony optimization
- cost function
- evolutionary algorithm
- search space
- benchmark instances
- computational complexity
- objective function
- similarity measure