Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
From MaRDI portal
Publication:439320
DOI10.1016/J.EJOR.2011.08.029zbMATH Open1244.90093OpenAlexW2082886370MaRDI QIDQ439320FDOQ439320
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust discrete optimization and its applications
- On the robust shortest path problem.
- Optimal two- and three-stage production schedules with set-up time included
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Interval data minmax regret network optimization problems
- The Complexity of Flowshop and Jobshop Scheduling
- 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
- On the complexity of a class of combinatorial optimization problems with uncertainty
- On the robust single machine scheduling problem
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Robustness in operational research and decision aiding: a multi-faceted issue
- Makespan minimization in open shops: A polynomial 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
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- Approximability of flow shop scheduling
- 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
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Approximating Single Machine Scheduling with Scenarios
- On the approximability of robust spanning tree problems
- On the approximability of minmax (regret) network optimization problems
Cited In (23)
- Approximation results for makespan minimization with budgeted uncertainty
- On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty
- Online makespan minimization with budgeted uncertainty
- Minimizing value-at-risk in single-machine scheduling
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- A distributionally robust approach for the two-machine permutation flow shop scheduling
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty
- Distributionally robust single machine scheduling with the total tardiness criterion
- Single machine robust scheduling with budgeted uncertainty
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- Approximation Schemes for Robust Makespan Scheduling Problems
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- A state-of-the-art survey on multi-scenario scheduling
- Exact Algorithms for Distributionally ฮฒ-Robust Machine Scheduling with Uncertain Processing Times
- Combining prospect theory with fuzzy theory to handle disruption in production scheduling
- Scheduling in multi-scenario environment with an agreeable condition on job processing times
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry
- A Probabilistic Analysis of Two-Machine Flowshops
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty
- Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective
- An improved genetic algorithm for single-machine inverse scheduling problem
Recommendations
- Title not available (Why is that?) ๐ ๐
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint ๐ ๐
- A new approach to two-machine flow shop problem with uncertain processing times ๐ ๐
- Approximation schemes for two-machine flow shop scheduling with two agents ๐ ๐
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ๐ ๐
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty ๐ ๐
- Two-machine flowshop minimum-length scheduling problem with random and bounded processing times ๐ ๐
- Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times ๐ ๐
- Constraint programming for the robust two-machine flow-shop scheduling problem with budgeted uncertainty ๐ ๐
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times ๐ ๐
This page was built for publication: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439320)
