Login / Signup
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness.
Victor Fernandez-Viagas
Jose M. Framiñan
Published in:
Comput. Oper. Res. (2015)
Keyphrases
</>
computationally efficient
computational complexity
lower bound
scheduling problem
image quality
computational efficiency
single machine
efficient solutions