A distributionally robust approach for the two-machine permutation flow shop scheduling
From MaRDI portal
Publication:6588501
DOI10.1007/s10479-023-05489-xzbMATH Open1545.90076MaRDI QIDQ6588501
Publication date: 15 August 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)
Cites Work
- On heuristic solutions for the stochastic flowshop scheduling problem
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
- Minimizing worst-case and average-case makespan over scenarios
- Distributionally robust single machine scheduling with risk aversion
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
- Distributionally robust scheduling on parallel machines under moment uncertainty
- A distributionally robust optimization approach for stochastic elective surgery scheduling with limited intensive care unit capacity
- Target-based distributionally robust optimization for single machine scheduling
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- A distributionally robust optimization approach for outpatient colonoscopy scheduling
- Wasserstein distributionally robust shortest path problem
- Appointment scheduling for multi-stage sequential service systems with stochastic service durations
- Exact solution of the two-machine flow shop problem with three operations
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty
- Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
- The sample average approximation method for stochastic discrete optimization
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations
- Scheduling
- Single machine scheduling with release dates: a distributionally robust approach
This page was built for publication: A distributionally robust approach for the two-machine permutation flow shop scheduling