Robust Optimization of Schedules Affected by Uncertain Events

Abstract

In this paper, we present a new method for finding robust solutions to mixed-integer linear programs subject to uncertain events. We present a new modeling framework for such events that result in uncertainty sets that depend parametrically on the decision taken. We also develop results that can be used to compute corresponding robust solutions. The usefulness of our proposed approach is illustrated by applying it in the context of a scheduling problem. For instance, we address uncertainty on the start times chosen for the tasks or on which unit they are to be executed. Delays and unit outages are possible causes for such events and can be very common in practice. Through our approach, we can accommodate them without altering the remainder of the schedule. We also allow for the inclusion of recourse on the continuous part of the problem, that is, we allow for the revision of some of the decisions once uncertainty is observed. This allows one to increase the performance of the robust solutions. The proposed scheme is also computationally favorable since the robust optimization problem to be solved remains a mixed-integer linear program, and the number of integer variables is not increased with respect to the nominal formulation. We finally apply the method to a concrete batch scheduling problem and discuss the effects of robustification in this case.Communicated by Christodoulos Floudas.

Robust Optimization for the Pooling Problem

“…Fig. (6) shows a comparison between the multi-cut robust cutting plane approach and the safety factor approach outlined above. For instance Haverly 2, the safety factor approach (with optimized safety factors) is almost identical to the robust approach.…”

“…Uncertainty set size r Objective value Robust optimization has become increasingly popular as a tool for planning and scheduling of chemical and manufacturing processes under parametric uncertainty [1][2][3][4][5][6][7][8][9] .…”

Task Scheduling for Multiunit Parallel Test Using Mixed-Integer Linear Programming

“…e following symbols (see Table 2) are used in modelling the problem [24,25]. e problem of task scheduling for multiunit parallel test can be stated as follows: given test tasks set T, test resources set R, test time set τ, and task-resource dependency matrix A, the objective is to find an optimal task schedule (x, s) that minimizes the overall test time without violating the prerequisite technological task sequence y 0 .…”

Distributionally robust optimization with decision dependent ambiguity sets

“…In robust combinatorial optimization, decision dependent uncertainty set is used to ensure the same relative protection level of all binary decision vectors (Poss, 2013). To model a robust task scheduling problem with uncertainty in the processing time, Vujanic et al (2016) proposed a decision dependent uncertainty set as a Minkowski sum of some static sets such that the uncertain completion time interval of a task can naturally depend on the starting time of the task. Hu et al (2015) studied a newsvendor model where the product demand may depend on the selling price.…”