A single-machine scheduling problem with uncertainty in processing times and outsourcing costs

DOI10.1155/2017/5791796MaRDI QIDQ1992893zbMATH OpenOpenAlexWikidataFDO

Authors Myoung-Ju Park, Byung-Cheon Choi

Publication date 5 November 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/5791796

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Complexity of single machine scheduling problems under scenario-based uncertainty
• Minimizing maximum cost for a single machine under uncertainty of processing times
• A single-machine scheduling problem with random processing times
• Single machine scheduling problems with uncertain parameters and the OWA criterion
• Single machine scheduling to minimize the number of late jobs under uncertainty.
• Single machine robust scheduling with budgeted uncertainty
• Single machine scheduling under market uncertainty
• Single-machine just-in-time scheduling with outsourcing
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
• The stochastic single machine scheduling problem with earliness and tardiness costs

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
• A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
• A survey on offline scheduling with rejection
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• Job selection in a heavily loaded shop
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
• On a constant factor approximation for minmax regret problems using a symmetry point scenario
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Robust discrete optimization and its applications
• Techniques for scheduling with rejection

Cited in

(5)

• Single machine scheduling problems with uncertain parameters and the OWA criterion
• A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
• 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
• A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty

This page was built for publication: A single-machine scheduling problem with uncertainty in processing times and outsourcing costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992893)