A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
From MaRDI portal
Publication:943795
DOI10.1016/j.orl.2007.11.004zbMath1151.90417OpenAlexW1983527457MaRDI QIDQ943795
Paweł Zieliński, Adam Kasperski
Publication date: 10 September 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.11.004
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (24)
Optimality region for job permutation in single-machine scheduling with uncertain processing times ⋮ Investigating the recoverable robust single machine scheduling problem under interval uncertainty ⋮ Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios ⋮ Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem ⋮ Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty ⋮ Scheduling under linear constraints ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Measures of problem uncertainty for scheduling with interval processing times ⋮ Minimizing total weighted completion time with uncertain data: a stability approach ⋮ Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Approximating a two-machine flow shop scheduling under discrete scenario uncertainty ⋮ On a constant factor approximation for minmax regret problems using a symmetry point scenario ⋮ A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines ⋮ Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times ⋮ Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion ⋮ A single-machine scheduling problem with uncertainty in processing times and outsourcing costs ⋮ Minimizing total weighted flow time under uncertainty using dominance and a stability box ⋮ A 2-approximation for minmax regret problems via a mid-point scenario optimal solution ⋮ Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion ⋮ Single machine scheduling problem with interval processing times and total completion time objective ⋮ JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY ⋮ Robust discrete spanning tree problem: local search algorithms
Cites Work
- Unnamed Item
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Robust discrete optimization and its applications
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Complexity of Scheduling under Precedence Constraints
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
This page was built for publication: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
