Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem

by   Pascale Bendotti, et al.

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 subset of jobs whose starting times are guaranteed. The problem was proven NP-hard even for budgeted uncertainty. In the present work we design mixed-integer programming (MIP) formulations that are valid for a variety of uncertainty sets encompassing budgeted uncertainty. A new dominance among solutions is proposed, resulting into an MIP formulation. We further study the combinatorial structure of the problem. Non-trivial polynomial cases under budgeted uncertainty are exhibited, where the dominance-based formulation yields a polyhedral characterization of integer solutions. In more general cases, the dominance-based formulation is shown to be tighter than all previously known formulations. In numerical experiments we investigate how the formulation performs on instances around the polynomial cases, for both budgeted uncertainty sets and more elaborate uncertainty sets involving several budgets.



There are no comments yet.


page 1

page 2

page 3

page 4


Recoverable Robust Single Machine Scheduling with Interval Uncertainty

We investigate the recoverable robust single machine scheduling problem ...

A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem

This paper presents a mixed-integer linear programming formulation for t...

A Bounded Formulation for The School Bus Scheduling Problem

This paper proposes a new formulation for the school bus scheduling prob...

Recoverable Robust Single Machine Scheduling with Budgeted Uncertainty

This paper considers a recoverable robust single-machine scheduling prob...

Multi-Core Processor Scheduling with Respect to Data Bus Bandwidth

The paper considers the problem of scheduling software modules on a mult...

NICE: Robust Scheduling through Reinforcement Learning-Guided Integer Programming

Integer programs provide a powerful abstraction for representing a wide ...

On the extension complexity of scheduling

Linear programming is a powerful method in combinatorial optimization wi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.