Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms.
Weishi ShaoDechang PiZhongshi ShaoPublished in: Knowl. Based Syst. (2017)
Keyphrases
- scheduling problem
- greedy algorithms
- greedy algorithm
- flowshop
- permutation flowshop
- single machine
- np hard
- squeaky wheel
- processing times
- setup times
- minimizing makespan
- knapsack problem
- unrelated parallel machines
- tabu search
- distributed systems
- distributed environment
- optimization problems
- precedence constraints
- strongly np hard
- optimization algorithm
- sequence dependent setup times
- cooperative
- maximum lateness
- global optimization
- parallel machines
- optimization process
- peer to peer
- worst case
- mobile agents
- release dates
- optimal solution
- job shop
- multi objective
- computational complexity
- autonomy oriented computing
- linear programming