What is it about?

The flow-shop minimum-length scheduling problem with n jobs processed on two machines is addressed where processing times are uncertain: lower and upper bounds for the random processing time are given before scheduling, but its probability distribution between these bounds is unknown. For such a problem, there often does not exist a dominant schedule that remains optimal for all possible realizations of the job processing times, and we look for a minimal set of schedules that is dominant. Such a minimal dominant set of schedules may be represented by a dominance digraph. We investigate useful properties of such a digraph.

Featured Image

Read the Original

This page is a summary of: The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times, Optimization, December 2011, Taylor & Francis,
DOI: 10.1080/02331931003657691.
You can read the full text:

Read

Contributors

The following have contributed to this page