Minimizing maximum cost for a single machine under uncertainty of processing times

DOI10.1016/J.EJOR.2020.03.052MaRDI QIDQ2184134zbMATH OpenOpenAlexFDO

Authors Ilia Fridman, Erwin Pesch, Y. Shafransky

Publication date 27 May 2020

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2020.03.052

zbMATH Keywords

Lawler's algorithmmaximum regretmin-max cost scheduling problemschedulinguncertainty

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Lawler's minmax cost problem under uncertainty
• Lawler's minmax cost algorithm: optimality conditions and uncertainty
• Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective

Cites work

• A Robust Optimization Approach to Inventory Theory
• An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3087284 (Why is no real title available?)
• Improved polynomial algorithms for robust bottleneck problems with interval data
• Lawler's minmax cost algorithm: optimality conditions and uncertainty
• Lawler's minmax cost problem under uncertainty
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
• Minmax regret solutions for minimax optimization problems with uncertainty
• On a constant factor approximation for minmax regret problems using a symmetry point scenario
• On recoverable and two-stage robust selection problems with budgeted uncertainty
• On two single machine scheduling problems with fuzzy processing times and fuzzy due dates
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Recent advances in robust optimization: an overview
• Robust discrete optimization and its applications
• Scheduling under fuzziness
• Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach

Cited in

(9)

• A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
• Lawler's minmax cost problem under uncertainty
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
• Lawler's minmax cost algorithm: optimality conditions and uncertainty
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
• Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Min-max relative regret for scheduling to minimize maximum lateness
• Recoverable robust single machine scheduling with polyhedral uncertainty

This page was built for publication: Minimizing maximum cost for a single machine under uncertainty of processing times

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