The minmax regret permutation flow-shop problem with two jobs

DOI10.1016/j.ejor.2004.07.073zbMath1079.90047OpenAlexW1974652680MaRDI QIDQ2572850

Igor Averbakh

Publication date: 4 November 2005

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

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

zbMATH Keywords

SchedulingUncertainty modelingMinmax regret optimization

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Exact solutions for the two-machine robust flow shop with budgeted uncertainty ⋮ Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Min-max relative regret for scheduling to minimize maximum lateness ⋮ Approximating a two-machine flow shop scheduling under discrete scenario uncertainty ⋮ Minimizing total weighted flow time under uncertainty using dominance and a stability box ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey

Cites Work

• Unnamed Item
• Robust discrete optimization and its applications
• Minmax regret solutions for minimax optimization problems with uncertainty
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• On the complexity of a class of combinatorial optimization problems with uncertainty

This page was built for publication: The minmax regret permutation flow-shop problem with two jobs