A robust basic cyclic scheduling problem
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...
Enregistré dans:
Auteurs principaux: | , , |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Elsevier
2018
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/15acdbc9b02f4ffdb5ab61490b1f53a8 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Soyez le premier à ajouter un commentaire!