A Hybrid Imperialist Competitive Algorithm for the Distributed Unrelated Parallel Machines Scheduling Problem.
You-Lian ZhengYue YuanQiaoxian ZhengDeming LeiPublished in: Symmetry (2022)
Keyphrases
- unrelated parallel machines
- scheduling problem
- imperialist competitive algorithm
- parallel machines
- hybrid algorithm
- setup times
- global optimization
- flowshop
- tabu search
- single machine
- np hard
- precedence constraints
- processing times
- job shop
- job shop scheduling
- particle swarm optimisation
- k means
- distributed systems
- open shop
- scheduling jobs
- job shop scheduling problem
- lower bound
- dynamic programming
- genetic algorithm
- branch and bound algorithm
- optimization algorithm