A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime.

Quan-Ke Pan Rubén Ruiz

Published in: Comput. Oper. Res. (2013)

Keyphrases

permutation flowshop
scheduling problem
total flowtime

upper bound
greedy algorithm
strongly np hard

single machine
search algorithm
flowshop

tabu search
setup times
minimizing makespan