Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
From MaRDI portal
Publication:5060784
DOI10.1287/IJOC.2022.1229zbMATH Open1505.90061OpenAlexW4292265796MaRDI QIDQ5060784FDOQ5060784
Authors: Guopeng Song, Roel Leus
Publication date: 11 January 2023
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2022.1229
Recommendations
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Parallel machine scheduling under uncertainty
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
Cites Work
- Title not available (Why is that?)
- From CVaR to uncertainty set: implications in joint chance-constrained optimization
- Theory and applications of robust optimization
- Robust optimization
- The Price of Robustness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Robust discrete optimization and its applications
- Distributionally robust joint chance constraints with second-order moment information
- Discrete optimization with decision diagrams
- Distributionally robust stochastic knapsack problem
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Introduction to Stochastic Programming
- Robust linear optimization under general norms.
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Title not available (Why is that?)
- Project scheduling under uncertainty: survey and research potentials
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
- Data-driven chance constrained stochastic program
- Optimal allocation of surgery blocks to operating rooms under uncertainty
- Exact solution of the robust knapsack problem
- On the robust knapsack problem
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- Models for minimax stochastic linear optimization problems with risk aversion
- Principles of Sequencing and Scheduling
- Binary Decision Diagrams
- Improving Discrete Model Representations via Symmetry Considerations
- A Robust Optimization Approach to Inventory Theory
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
- Stochastic Scheduling with Release Dates and Due Dates
- Polymatroids and mean-risk minimization in discrete optimization
- Minimizing the number of late jobs in a stochastic setting using a chance constraint
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- An exact algorithm for the identical parallel machine scheduling problem.
- Single-machine scheduling subject to stochastic breakdowns
- Heuristic and exact algorithms for the identical parallel machine scheduling problem
- Distributionally Robust Convex Optimization
- Robust scheduling with budgeted uncertainty
- Ambiguous joint chance constraints under mean and dispersion information
- Target cuts from relaxed decision diagrams
- Distributionally robust single machine scheduling with the total tardiness criterion
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Distributionally robust single machine scheduling with risk aversion
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- An exact algorithm for parallel machine scheduling with conflicts
- Exact algorithms for the chance-constrained vehicle routing problem
- On deterministic reformulations of distributionally robust joint chance constrained optimization problems
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
- Exact lexicographic scheduling and approximate rescheduling
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- The distributionally robust chance-constrained vehicle routing problem
- Branch and Price for Chance-Constrained Bin Packing
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
Cited In (19)
- A new model and algorithm for uncertain random parallel machine scheduling problem
- Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Sensitivity bounds for machine scheduling with uncertain communication delays
- Title not available (Why is that?)
- Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Scheduling and packing under uncertainty
- Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees
- Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- Parallel machine scheduling under uncertainty
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- Towards a robust scheduling on unrelated parallel machines: a scenarios based approach
- An adaptive robust optimization model for parallel machine scheduling
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty
- Parallel machine scheduling models with fuzzy processing times
This page was built for publication: Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060784)