Recoverable robust single machine scheduling with polyhedral uncertainty
From MaRDI portal
Cites work
- K-adaptability in two-stage robust binary programming
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- A compact reformulation of the two-stage robust resource-constrained project scheduling problem
- A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem
- A family of inequalities valid for the robust single machine scheduling polyhedron
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Algorithms and complexity analysis for robust single-machine scheduling problems
- Benchmarking optimization software with performance profiles.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Distributionally robust single machine scheduling with risk aversion
- scientific article; zbMATH DE number 7803597 (Why is no real title available?)
- Integer Programming: Methods, Uses, Computations
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- Maximum matching and a polyhedron with 0,1-vertices
- Min-max-min robust combinatorial optimization
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Minimizing maximum cost for a single machine under uncertainty of processing times
- Minimizing the number of late jobs on a single machine under due date uncertainty
- On the robust single machine scheduling problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Risk-averse single machine scheduling: complexity and approximation
- Robust discrete optimization and its applications
- Robust scheduling on a single machine to minimize total flow time
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Robust scheduling with budgeted uncertainty
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Single machine scheduling with scenarios
- The concept of recoverable robustness, linear programming recovery, and railway applications
- The Price of Robustness
Cited in
(1)
This page was built for publication: Recoverable robust single machine scheduling with polyhedral uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956295)
