Algorithms and complexity analysis for robust single-machine scheduling problems
From MaRDI portal
Publication:906553
DOI10.1007/s10951-015-0418-0zbMath1333.90053OpenAlexW1973245608MaRDI QIDQ906553
Publication date: 22 January 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-015-0418-0
Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (17)
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty ⋮ Online makespan minimization with budgeted uncertainty ⋮ Distributionally robust single machine scheduling with the total tardiness criterion ⋮ Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ Robust combinatorial optimization with knapsack uncertainty ⋮ Robust scheduling with budgeted uncertainty ⋮ Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Single machine robust scheduling with budgeted uncertainty ⋮ Min-max relative regret for scheduling to minimize maximum lateness ⋮ A robust optimization approach for the unrelated parallel machine scheduling problem ⋮ Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times ⋮ Minimizing the weighted sum of completion times under processing time uncertainty ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ Distributionally robust single machine scheduling with risk aversion ⋮ Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty ⋮ Approximation results for makespan minimization with budgeted uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the robust single machine scheduling problem
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Robust discrete optimization and its applications
- Minmax regret solutions for minimax optimization problems with uncertainty
- Robust scheduling on a single machine to minimize total flow time
- Deterministic network interdiction
- A family of inequalities valid for the robust single machine scheduling polyhedron
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- The Price of Robustness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Introduction to Stochastic Programming
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Algorithms and complexity analysis for robust single-machine scheduling problems
