Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach
This study considers the aircraft sequencing and scheduling problem under the uncertainty
of arrival and departure delays for multiple heterogeneous mixed-mode parallel runways. To …
of arrival and departure delays for multiple heterogeneous mixed-mode parallel runways. To …
Algorithm engineering in robust optimization
Robust optimization is a young and emerging field of research having received a
considerable increase of interest over the last decade. In this paper, we argue that the …
considerable increase of interest over the last decade. In this paper, we argue that the …
Robust discrete optimization under discrete and interval uncertainty: A survey
A Kasperski, P Zieliński - … analysis in decision aiding, optimization, and …, 2016 - Springer
In this chapter a review of recent results on robust discrete optimization is presented. The
most popular discrete and interval uncertainty representations are discussed. Various robust …
most popular discrete and interval uncertainty representations are discussed. Various robust …
A two-stage robust optimisation for terminal traffic flow problem
Airport congestion witnesses potential conflicts: insufficient terminal airspace and delay
propagation within scrambled the competition in the terminal manoeuvring area. Re …
propagation within scrambled the competition in the terminal manoeuvring area. Re …
[HTML][HTML] Investigating the recoverable robust single machine scheduling problem under interval uncertainty
We investigate the recoverable robust single machine scheduling problem under interval
uncertainty. In this setting, jobs have first-stage processing times p and second-stage …
uncertainty. In this setting, jobs have first-stage processing times p and second-stage …
A decomposition based solution algorithm for U-type assembly line balancing with interval data
Balancing U-type assembly lines under uncertainty is addressed in this paper by formulating
a robust problem and developing its optimization model and algorithm. U-type assembly …
a robust problem and developing its optimization model and algorithm. U-type assembly …
The robust (minmax regret) assembly line worker assignment and balancing problem
J Pereira - Computers & Operations Research, 2018 - Elsevier
Line balancing aims to assign the assembly tasks to the stations that compose the assembly
line. A recent body of literature has been devoted to heterogeneity in the assembly process …
line. A recent body of literature has been devoted to heterogeneity in the assembly process …
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
J Pereira - Computers & Operations Research, 2016 - Elsevier
Single machine scheduling is a classical optimization problem that depicts multiple real life
systems in which a single resource (the machine) represents the whole system or the …
systems in which a single resource (the machine) represents the whole system or the …
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem
W Wu, M Iori, S Martello, M Yagiura - Computers & Industrial Engineering, 2018 - Elsevier
We consider the generalized assignment problem (GAP) with min-max regret criterion under
interval costs. This problem models many real-world applications in which jobs must be …
interval costs. This problem models many real-world applications in which jobs must be …
Heuristic and exact algorithms for the interval min–max regret knapsack problem
We consider a generalization of the 0–1 knapsack problem in which the profit of each item
can take any value in a range characterized by a minimum and a maximum possible profit. A …
can take any value in a range characterized by a minimum and a maximum possible profit. A …