NobleBlocks
Public

A robust basic cyclic scheduling problem

Published in Elsevier • Sep 1, 2018
NobleIDNI4P04W87R55S97
Authors:
Idir Hamaz
,
Laurent Houssin
,
Sonia Cafieri

Abstract

This paper addresses the Basic Cyclic Scheduling Problem where the processing times are affected by uncertainties. We formulate the problem as a two-stage robust optimization problem with a budgeted uncertainty set. More precisely, we consider the uncertainty set introduced by Bertsimas and Sim (Ope...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!