Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
DOI10.1016/J.EJOR.2015.12.046zbMATH Open1346.90333OpenAlexW2238955734MaRDI QIDQ322893FDOQ322893
Authors: 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
Recommendations
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- Minimizing maximum cost for a single machine under uncertainty of processing times
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
- Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Algorithms for minclique scheduling problems
- Robust discrete optimization and its applications
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Single machine scheduling with scenarios
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Two-machine flow shop scheduling problem with an outsourcing option
- Multiprocessor Scheduling with Rejection
- Minimizing the number of late jobs on a single machine under due date uncertainty
- On the robust single machine scheduling problem
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Outsourcing and scheduling for two-machine ordered flow shop scheduling problems
- Competition and Outsourcing with Scale Economies
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- 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
Cited In (9)
- Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates
- In-house production and outsourcing under different discount schemes on the total outsourcing cost
- Coordinated scheduling of the outsourcing, in-house production and distribution operations
- A survey of job shop scheduling problem: the types and models
- An improved algorithm for a two-stage production scheduling problem with an outsourcing option
- A state-of-the-art survey on multi-scenario scheduling
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- Competitive difference analysis of the cash management problem with uncertain demands
- Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution
This page was built for publication: Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322893)
