Sign in
Using Iterated Greedy with a New Population Approach for the Flexible Jobshop Scheduling Problem.
Ghiath Al Aqel
Xinyu Li
Liang Gao
Wenyin Gong
Rui Wang
Teng Ren
Guohua Wu
Published in:
IEEM (2018)
Keyphrases
</>
scheduling problem
iterated greedy
np hard
flowshop
single machine
processing times
tabu search
permutation flowshop
job shop scheduling problem
precedence constraints
lightweight
parallel machines
release dates
minimizing makespan