Login / Signup
A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion.
Jing-nan Shen
Ling Wang
Shengyao Wang
Published in:
Knowl. Based Syst. (2015)
Keyphrases
</>
total tardiness
flowshop
single machine
scheduling problem
parallel machines
estimation of distribution algorithms
combinatorial optimization
processing times
special case
response time
sequence dependent setup times
evolutionary algorithm