To deal with the impact of uncertain material supply on the implementation of projects, we
investigate a problem of concurrently finding a robust baseline schedule and a material …

This paper presents a mixed-integer linear programming formulation for the multi-mode
resource-constrained project scheduling problem with uncertain activity durations. We …

The concept of anchored solutions is proposed as a new robust optimization approach to the
Resource-Constrained Project Scheduling Problem (RCPSP) under processing times …

This paper considers a recoverable robust single-machine scheduling problem under
polyhedral uncertainty with the objective of minimising the total flow time. In this setting, a …

In project scheduling under processing times uncertainty, the Anchor-Robust Project
Scheduling Problem is to find a baseline schedule of bounded makespan and a max-weight …

In large-scale scheduling applications, it is often decisive to find reliable schedules prior to
the execution of the project. Most of the time however, data is affected by various sources of …

We propose a two‐stage recoverable robustness approach that minimizes the recovery cost.
In many applications, once the uncertainty ξ ξ is revealed, it can be more important to …

Other Combinatorial Problems | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

Solution robustness focuses on structural similarities between the nominal solution and the
scenario solutions. Most other robust optimization approaches focus on the quality …

A Mixed Integer Linear Program (MILP) is a mathematical model that involves optimizing a
linear function over a feasible region described by linear constraints where a subset of …