What is it about?

This paper compares different constructive and iterative heuristic algorithms for the flexible flow shop problem. Machines at the stages can be unrelated, setup times may occur, and the objective is the minimization of a weighted combination of makespan and the number of late jobs.

Featured Image

Why is it important?

An extensive comparison of the different algorithms is made for a great variety of instances.

Read the Original

This page is a summary of: A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria, Computers & Operations Research, February 2009, Elsevier, DOI: 10.1016/j.cor.2007.10.004.
You can read the full text:

Read

Contributors

The following have contributed to this page