Exact solutions for the two-machine robust flow shop with budgeted uncertainty

DOI10.1016/j.ejor.2021.10.021zbMath1495.90077OpenAlexW3205161453MaRDI QIDQ2670559

Mario Levorato, Yuri Frota, Rosa M. V. Figueiredo

Publication date: 11 March 2022

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

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

zbMATH Keywords

schedulingflow shoprobust optimizationbudget of uncertaintycolumn-and-constraint generation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Maximizing total early work in a distributed two‐machine flow‐shop ⋮ Constraint programming for the robust two-machine flow-shop scheduling problem with budgeted uncertainty ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ An uncertain permutation flow shop predictive scheduling problem with processing interruption ⋮ A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On heuristic solutions for the stochastic flowshop scheduling problem
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Robust solutions of linear programming problems contaminated with uncertain data
• Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
• Robust optimization-methodology and applications
• On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
• Multi-process production scheduling with variable renewable integration and demand response
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
• The minmax regret permutation flow-shop problem with two jobs
• Optimal two- and three-stage production schedules with setup times included
• Sequencing with uncertain numerical data for makespan minimisation
• The Price of Robustness
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• An Improved Formulation for the Job-Shop Scheduling Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Stability of Johnson's schedule with respect to limited machine availability
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Scheduling

This page was built for publication: Exact solutions for the two-machine robust flow shop with budgeted uncertainty