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

DOI10.1155/2017/5791796zbMath1426.90131OpenAlexW2594037866WikidataQ59147634 ScholiaQ59147634MaRDI QIDQ1992893

Myoung-Ju Park, Byung-Cheon Choi

Publication date: 5 November 2018

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

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A state-of-the-art survey on multi-scenario scheduling

Cites Work

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

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