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: | Idir Hamaz, Laurent Houssin, Sonia Cafieri |
---|---|
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!
|
Documents similaires
-
Speeding up column generation for robust wireless network planning
par: Grit Claßen, et autres
Publié: (2013) -
New exact solution approaches for the split delivery vehicle routing problem
par: Gizem Ozbaygin, et autres
Publié: (2018) -
Bilevel programming for price-based electricity auctions: a revenue-constrained case
par: Ricardo Fernández-Blanco, et autres
Publié: (2015) -
A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber
par: Heiner Ackermann, et autres
Publié: (2020) -
Integration of routing into a resource-constrained project scheduling problem
par: Philippe Lacomme, et autres
Publié: (2019)