Robust Optimization of Schedules Affected by Uncertain Events

Vujanic, Robin; Goulart, Paul; Morari, Manfred
December 2016
Journal of Optimization Theory & Applications;Dec2016, Vol. 171 Issue 3, p1033
Academic Journal
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.


Related Articles

  • Robust delay-constrained routing in telecommunications. Hijazi, Hassan; Bonami, Pierre; Ouorou, Adam // Annals of Operations Research;Jul2013, Vol. 206 Issue 1, p163 

    In telecommunications, operators usually use market surveys and statistical models to estimate traffic evolution in networks or to approximate queuing delay functions in routing strategies. Many research activities concentrated on handling traffic uncertainty in network design. Measurements on...

  • MineLib: a library of open pit mining problems. Espinoza, Daniel; Goycoolea, Marcos; Moreno, Eduardo; Newman, Alexandra // Annals of Operations Research;Jul2013, Vol. 206 Issue 1, p93 

    Similar to the mixed-integer programming library (MIPLIB), we present a library of publicly available test problem instances for three classical types of open pit mining problems: the ultimate pit limit problem and two variants of open pit production scheduling problems. The ultimate pit limit...

  • A 0–1 integer linear programming approach to schedule outages of nuclear power plants. Jost, V.; Savourey, D. // Journal of Scheduling;Dec2013, Vol. 16 Issue 6, p551 

    We address the problem of planning outages of nuclear power plants submitted by EDF (Électricité De France) as the challenge EURO/ROADEF 2010. As our team won the first prize of the contest in the senior category, our approach may be of interest: it is conceptually simple, easy to program...

  • Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP). Pinto, Gaby; Ben-Dov, Yariv; Rabinowitz, Gad // Annals of Operations Research;Jul2013, Vol. 206 Issue 1, p311 

    The main motivation of this study is to provide, for the first time, a formulation and solution for a class of production scheduling problems (as in cluster tools) characterized mainly by resource collaboration to perform an operation and while allowing batches and considering alternative...

  • Preference-based assignment of university students to multiple teaching groups. Heitmann, Henrik; Brüggemann, Wolfgang // OR Spectrum;Jul2014, Vol. 36 Issue 3, p607 

    A successful approach to the student-scheduling problem is presented here. This problem arises naturally when courses and classes must be offered in such a large number of multiple teaching groups that some of these are timetabled in parallel, i.e. simultaneously. This is the case, for example,...

  • Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization. Bertsimas, Dimitris; Georghiou, Angelos // Operations Research;May/Jun2015, Vol. 63 Issue 3, p610 

    In recent years, decision rules have been established as the preferred solution method for addressing computationally demanding, multistage adaptive optimization problems. Despite their success, existing decision rules (a) are typically constrained by their a priori design and (b) do not...

  • Production Scheduling and Customer Orders Assignment in a Three-Level Supply Chain. F. Sadeghi Naieni Fard; Naderi, B.; Akbari, A. A. // ISRN Otolaryngology;2014, p1 

    In the classical production-distribution centers problem, only assignment of customers, distribution centers, and suppliers is determined. This paper extends the problem of production-distribution centers assignment by considering sequencing decisions in the supply network. Now a days, meeting...

  • On considering dual-role factor in supplier selection problem. Toloo, Mehdi; Barat, Mona // Mathematical Methods of Operations Research;Aug2015, Vol. 82 Issue 1, p107 

    Conventional data envelopment analysis evaluates the relative efficiency of a set of homogeneous decision making units (DMUs), where DMUs are evaluated in terms of a specified set of inputs and outputs. In some situations, however, a performance factor could serve as either an output or an...

  • Congestion Service Facilities Location Problem with Promise of Response Time. Dandan Hu; Zhi-Wei Liu; Wenshan Hu // Mathematical Problems in Engineering;2013, p1 

    In many services, promise of specific response time is advertised as a commitment by the service providers for the customer satisfaction. Congestion on service facilities could delay the delivery of the services and hurts the overall satisfaction. In this paper, congestion service facilities...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics