Maximization of schedule reliability under uncertain job processing times

Abstrakt

Interval scheduling problem aims at assigning jobs to machines where the job starting and finishing times are known. If random delays influence the job processing times, the objective can be to find a schedule which remains feasible with the highest possible probability.

In this paper, we propose the formulations based on stochastic integer programming and robust coloring problems. The second one leads to a large scale binary-linear programming problem.We report first numerical results based on simulated instances.

Klíčová slova

• Interval scheduling
• stochastic delays
• stochastic integer programming
• robust coloring formulation