Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096)

The problem to be considered is one of scheduling tasks in a flexible flowshop environment. It differs from the classical one by the existence of parallel machines at each stage of the flowshop system. Since the problem of finding a minimum length schedule is obviously NP-hard, the authors propose several heuristic algorithms for solving the problem. Then, their worst case as well as mean behaviors, are analyzed.