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...
Guardado en:
Autores principales: | Idir Hamaz, Laurent Houssin, Sonia Cafieri |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2018
|
Materias: | |
Acceso en línea: | https://doaj.org/article/15acdbc9b02f4ffdb5ab61490b1f53a8 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Speeding up column generation for robust wireless network planning
por: Grit Claßen, et al.
Publicado: (2013) -
New exact solution approaches for the split delivery vehicle routing problem
por: Gizem Ozbaygin, et al.
Publicado: (2018) -
Bilevel programming for price-based electricity auctions: a revenue-constrained case
por: Ricardo Fernández-Blanco, et al.
Publicado: (2015) -
A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber
por: Heiner Ackermann, et al.
Publicado: (2020) -
Integration of routing into a resource-constrained project scheduling problem
por: Philippe Lacomme, et al.
Publicado: (2019)