Minimizing the weighted sum of completion times under processing time uncertainty

DOI10.1016/j.endm.2018.01.003zbMath1392.90059OpenAlexW2791420489MaRDI QIDQ1742192

Thi Sang Nguyen, Michael Poss, Zacharie Ales

Publication date: 11 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.01.003

zbMATH Keywords

integer programmingschedulingrobust optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty

Uses Software

• JuMP

Cites Work

• Robust combinatorial optimization with variable cost uncertainty
• On the robust single machine scheduling problem
• Algorithms and complexity analysis for robust single-machine scheduling problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Robust discrete optimization and network flows
• Robust solutions of linear programming problems contaminated with uncertain data
• Robust combinatorial optimization with variable budgeted uncertainty
• Robust scheduling with budgeted uncertainty
• The Price of Robustness
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Minimizing the weighted sum of completion times under processing time uncertainty