Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms.

Kuo-Ching Ying Shih-Wei Lin

Published in: IEEE Access (2017)

Keyphrases

minimizing makespan
greedy algorithms
scheduling problem
greedy algorithm
total flowtime
distributed systems
cooperative
parallel machines
flowshop
single machine
distributed environment
reinforcement learning
peer to peer
search algorithm
multi agent
tabu search
processing times
worst case
machine learning