A review of robust operations management under model uncertainty
Over the past two decades, there has been explosive growth in the application of robust
optimization in operations management (robust OM), fueled by both significant advances in …
optimization in operations management (robust OM), fueled by both significant advances in …
Min–max and min–max regret versions of combinatorial optimization problems: A survey
H Aissi, C Bazgan, D Vanderpooten - European journal of operational …, 2009 - Elsevier
Min–max and min–max regret criteria are commonly used to define robust solutions. After
motivating the use of these criteria, we present general results. Then, we survey complexity …
motivating the use of these criteria, we present general results. Then, we survey complexity …
Robust optimization for resource-constrained project scheduling with uncertain activity durations
The purpose of this paper is to propose models for project scheduling when there is
considerable uncertainty in the activity durations, to the extent that the decision maker …
considerable uncertainty in the activity durations, to the extent that the decision maker …
A Review of Robust Machine Scheduling
Robust optimization (RO) has been recognized as an effective means to deal with
unanticipated events in highly uncertain and risky environments. This paper systematically …
unanticipated events in highly uncertain and risky environments. This paper systematically …
[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 …
Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
W Wu, T Hayashi, K Haruyasu, L Tang - European Journal of Operational …, 2023 - Elsevier
We study robust single-machine batch scheduling problems under uncertain processing
times to minimize total flow time. Two types of batches are considered: serial batch (s-batch) …
times to minimize total flow time. Two types of batches are considered: serial batch (s-batch) …
Distributionally robust single machine scheduling with risk aversion
This paper presents a distributionally robust (DR) optimization model for the single machine
scheduling problem (SMSP) with random job processing time (JPT). To the best of our …
scheduling problem (SMSP) with random job processing time (JPT). To the best of our …
[KSIĄŻKA][B] Discrete optimization with interval data
A Kasperski - 2008 - Springer
In operations research applications we are often faced with the problem of incomplete or
uncertain data. This is caused by a lack of knowledge about the considered system or by a …
uncertain data. This is caused by a lack of knowledge about the considered system or by a …
Robust makespan minimisation in identical parallel machine scheduling problem with interval data
X Xu, W Cui, J Lin, Y Qian - International Journal of Production …, 2013 - Taylor & Francis
Parallel machine scheduling problems are commonly encountered in a wide variety of
manufacturing environments and have been extensively studied. This paper addresses a …
manufacturing environments and have been extensively studied. This paper addresses a …
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
This paper deals with the two machine permutation flow shop problem with uncertain data,
whose deterministic counterpart is known to be polynomially solvable. In this paper, it is …
whose deterministic counterpart is known to be polynomially solvable. In this paper, it is …