Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty

DOI10.1016/J.EJOR.2015.12.046MaRDI QIDQ322893zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexityuncertaintyschedulingoutsourcing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• Algorithms for minclique scheduling problems
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
• 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
• Competition and outsourcing with scale economies
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Minimizing the number of late jobs on a single machine under due date uncertainty
• Multiprocessor Scheduling with Rejection
• On the robust single machine scheduling problem
• Outsourcing and scheduling for two-machine ordered flow shop scheduling problems
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Robust discrete optimization and its applications
• Single machine scheduling with scenarios
• Two-machine flow shop scheduling problem with an outsourcing option

Cited in

(11)

• In-house production and outsourcing under different discount schemes on the total outsourcing cost
• Minimizing maximum cost for a single machine under uncertainty of processing times
• Coordinated scheduling of the outsourcing, in-house production and distribution operations
• Single machine scheduling with outsourcing under different fill rates or quantity discount rates
• 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 single-machine scheduling problem with uncertainty in processing times and outsourcing costs
• A state-of-the-art survey on multi-scenario scheduling
• Competitive difference analysis of the cash management problem with uncertain demands
• Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• 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)