Heuristics for no-wait flowshops with makespan subject to mean completion time.

Harun Aydilek Ali Allahverdi

Published in: Appl. Math. Comput. (2012)

Keyphrases

minimizing makespan
scheduling problem
total flowtime
flowshop scheduling problems
flowshop
permutation flowshop
processing times
greedy heuristics
total tardiness
flowshop scheduling
single machine
lower bound
optimal solution
search strategies
heuristic methods
np hard
search methods
case study
search algorithm