Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
From MaRDI portal
Publication:1790193
DOI10.1016/j.orl.2016.03.005zbMath1408.90124arXiv1412.4273OpenAlexW2963035806MaRDI QIDQ1790193
Publication date: 2 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.4273
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Robust approach to restricted items selection problem ⋮ Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios ⋮ Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ Risk-averse single machine scheduling: complexity and approximation ⋮ Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
Cites Work
- Complexity of the min-max and min-max regret assignment problems
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust discrete optimization and its applications
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- Scheduling
- Unnamed Item
This page was built for publication: Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
