The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective

This publication has 34 references indexed in Scilit:

• Single machine scheduling problem with interval processing times to minimize mean weighted completion time
  Computers & Operations Research, 2014
• Minimizing earliness and tardiness costs in stochastic scheduling
  European Journal of Operational Research, 2014
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
  Optimization Letters, 2013
• A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
  Operations Research Letters, 2010
• Min–max and min–max regret versions of combinatorial optimization problems: A survey
  European Journal of Operational Research, 2009
• The minmax regret permutation flow-shop problem with two jobs
  European Journal of Operational Research, 2006
• Minmax regret solutions for minimax optimization problems with uncertainty
  Operations Research Letters, 2000
• β-Robust scheduling for single-machine systems with uncertain processing times
  IIE Transactions, 1997
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
  Management Science, 1995
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
  1979