Login / Signup
An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance.
Jia-Yang Mao
Quan-Ke Pan
Zhong-Hua Miao
Liang Gao
Published in:
Expert Syst. Appl. (2021)
Keyphrases
</>
greedy algorithm
preventive maintenance
multi start
dynamic programming
greedy algorithms
worst case
objective function
greedy strategy
scheduling problem
metaheuristic
influence maximization
evolutionary algorithm
global optimization
knapsack problem
path relinking
tabu search
stochastic approximation