Mean flow time minimization with given bounds of processing times

What is it about?

A job shop scheduling problem with uncertain processing times and fixed precedence and capacity constraints is considered. Each of the random processing times can take any real value between given lower and upper bounds. The goal is to find a set of schedules which contains at least one optimal schedule (with mean flow time criterion) for any admissible realization of the random processing times. In order to compute such a set of schedules efficiently and keep it as small as possible, we develop several exact and heuristic algorithms and report computational experience based on randomly generated instances.

Featured Image