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...
Main Authors: | Idir Hamaz, Laurent Houssin, Sonia Cafieri |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2018-09-01
|
Series: | EURO Journal on Computational Optimization |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2192440621001040 |
Similar Items
-
New exact solution approaches for the split delivery vehicle routing problem
by: Gizem Ozbaygin, et al.
Published: (2018-03-01) -
A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber
by: Heiner Ackermann, et al.
Published: (2020-10-01) -
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
by: Dalia Attia, et al.
Published: (2019-12-01) -
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
by: François Clautiaux, et al.
Published: (2019-09-01) -
Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
by: FalkM. Hante, et al.
Published: (2019-09-01)