Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times
From MaRDI portal
Publication:5137951
DOI10.1287/ijoc.2018.0807zbMath1448.90046OpenAlexW2898848914MaRDI QIDQ5137951
Yuli Zhang, Shi-ji Song, Zuo-Jun Max Shen
Publication date: 3 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0807
parametric searchdistributionally robust\( \beta \)-robust schedulingspeedup shortest augmentation path algorithm
Related Items (8)
Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics ⋮ The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times ⋮ Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job ⋮ Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems ⋮ Target-based distributionally robust optimization for single machine scheduling ⋮ Distributionally robust front distribution center inventory optimization with uncertain multi-item orders
Cites Work
- Unnamed Item
- Unnamed Item
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Minimizing conditional-value-at-risk for stochastic scheduling problems
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- C-programming and the minimization of pseudolinear and additive concave functions
- On the robust single machine scheduling problem
- Incorporating inventory and routing costs in strategic location models
- Algorithms and complexity analysis for robust single-machine scheduling problems
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- Solving the rectangular assignment problem and applications
- Linear and semi-assignment problems: A core oriented approach
- A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- On Generalizations of Tchebychef's Inequality
- Robust Mean-Covariance Solutions for Stochastic Optimization
- Assignment Problems
- Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
- A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
- P-Complete Approximation Problems
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Stochastic Transportation-Inventory Network Design Problem
- Introduction to global optimization.
This page was built for publication: Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times
