Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
From MaRDI portal
Publication:322893
DOI10.1016/j.ejor.2015.12.046zbMath1346.90333OpenAlexW2238955734MaRDI QIDQ322893
Byung-Cheon Choi, Kwanghun Chung
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.12.046
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (9)
In-house production and outsourcing under different discount schemes on the total outsourcing cost ⋮ A survey of job shop scheduling problem: the types and models ⋮ Coordinated scheduling of the outsourcing, in-house production and distribution operations ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ A single-machine scheduling problem with uncertainty in processing times and outsourcing costs ⋮ Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution ⋮ An improved algorithm for a two-stage production scheduling problem with an outsourcing option ⋮ Competitive difference analysis of the cash management problem with uncertain demands ⋮ Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates
Cites Work
- Unnamed Item
- Two-machine flow shop scheduling problem with an outsourcing option
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Minimizing the number of late jobs on a single machine under due date uncertainty
- On the robust single machine scheduling problem
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- 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
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Robust discrete optimization and its applications
- Single machine scheduling with scenarios
- Outsourcing and scheduling for two-machine ordered flow shop scheduling problems
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Competition and Outsourcing with Scale Economies
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Multiprocessor Scheduling with Rejection
- Algorithms for minclique scheduling problems
This page was built for publication: Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
