Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
From MaRDI portal
Publication:439320
DOI10.1016/j.ejor.2011.08.029zbMath1244.90093OpenAlexW2082886370MaRDI QIDQ439320
Paweł Zieliński, Adam Kurpisz, Adam Kasperski
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.08.029
Related Items (20)
Online makespan minimization with budgeted uncertainty ⋮ Distributionally robust single machine scheduling with the total tardiness criterion ⋮ Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios ⋮ 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 ⋮ Exact solutions for the two-machine robust flow shop with budgeted uncertainty ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective ⋮ Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach ⋮ Single machine robust scheduling with budgeted uncertainty ⋮ On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty ⋮ An improved genetic algorithm for single-machine inverse scheduling problem ⋮ 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 ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ Approximation Schemes for Robust Makespan Scheduling Problems ⋮ Approximation results for makespan minimization with budgeted uncertainty ⋮ Scheduling in multi-scenario environment with an agreeable condition on job processing times ⋮ Combining prospect theory with fuzzy theory to handle disruption in production scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- On the approximability of robust spanning tree problems
- On the robust single machine scheduling problem
- Complexity of single machine scheduling problems under scenario-based uncertainty
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- On the approximability of minmax (regret) network optimization problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robustness in operational research and decision aiding: a multi-faceted issue
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Approximability of flow shop scheduling
- Makespan minimization in open shops: A polynomial time approximation scheme
- Robust discrete optimization and its applications
- On the robust shortest path problem.
- Interval data minmax regret network optimization problems
- 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
- The minmax regret permutation flow-shop problem with two jobs
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Optimal two- and three-stage production schedules with setup times included
- Approximating Single Machine Scheduling with Scenarios
- The Complexity of Flowshop and Jobshop Scheduling
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
- Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- On the complexity of a class of combinatorial optimization problems with uncertainty
This page was built for publication: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
