Distributionally robust optimization under a decision-dependent ambiguity set with applications to machine scheduling and humanitarian logistics

N Noyan, G Rudolf, M Lejeune - INFORMS Journal on …, 2022 - pubsonline.informs.org
We introduce a new class of distributionally robust optimization problems under decision-
dependent ambiguity sets. In particular, as our ambiguity sets, we consider balls centered on …

Unrelated parallel machine scheduling problem with stochastic sequence dependent setup times

T Saraç, F Ozcelik, M Ertem - Operational Research, 2023 - Springer
Unrelated parallel machine scheduling problem (UPM) is widely studied in the scheduling
literature because of its extensive application area in the industry. Since it has a stochastic …

Stochastic planning and scheduling with logic-based Benders decomposition

Ö Elçi, J Hooker - INFORMS Journal on Computing, 2022 - pubsonline.informs.org
We apply logic-based Benders decomposition (LBBD) to two-stage stochastic planning and
scheduling problems in which the second stage is a scheduling task. We solve the master …

A branch-and-bound approach to minimise the value-at-risk of the makespan in a stochastic two-machine flow shop

L Liu, M Urgo - International Journal of Production Research, 2024 - Taylor & Francis
Planning and scheduling approaches in real manufacturing environments entail the need to
cope with random attributes and variables to match the characteristics of real scheduling …

A stochastic bi-objective project scheduling model under failure of activities

F Rezaei, AA Najafi, E Demeulemeester… - Annals of Operations …, 2024 - Springer
In this paper, the research and development project scheduling problem (RDPSP) under
uncertain failure of activities is formulated where an activity's failure results in the project's …

A novel approach for minimizing processing times of three-stage flow shop scheduling problems under fuzziness

A Alburaikan, H Garg, HAEW Khalifa - Symmetry, 2023 - mdpi.com
The purpose of this research is to investigate a novel three-stage flow shop scheduling
problem with an ambiguous processing time. The uncertain information is characterized by …

The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times

ME Bruni, S Khodaparasti… - Computers & Operations …, 2020 - Elsevier
This paper proposes an interesting variant of the parallel machine scheduling problem with
sequence-dependent setup times, where a subset of jobs has to be selected to guarantee a …

Optimizing makespan and stability risks in job shop scheduling

Z Wu, S Sun, S Yu - Computers & Operations Research, 2020 - Elsevier
In real-world manufacturing environments, the execution of a schedule often encounters
uncertain events, which will bring the risks of performance deterioration and production …

Risk aversion to parameter uncertainty in Markov decision processes with an application to slow-onset disaster relief

M Meraklı, S Küçükyavuz - IISE Transactions, 2020 - Taylor & Francis
Abstract In classic Markov Decision Processes (MDPs), action costs and transition
probabilities are assumed to be known, although an accurate estimation of these …

Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: Branch-and-bound and heuristic algorithms based on …

L Liu, M Urgo - Annals of Operations Research, 2024 - Springer
This paper addresses a two-machine re-entrant flow shop scheduling problem with
stochastic processing times where each job is expected to require a rework phase, flowing …