Constraint programming for the robust two-machine flow-shop scheduling problem with budgeted uncertainty

DOI10.1007/978-3-031-33271-5_23OpenAlexW4321174710MaRDI QIDQ6080981

Pierre Lopez, Laurent Houssin, Carla Juvin

Publication date: 4 October 2023

Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-33271-5_23

zbMATH Keywords

robust optimizationconstraint programmingmixed-integer linear programmingflow-shop schedulinguncertainty budget

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Adjustable robust solutions of uncertain linear programs
• A branch-and-bound procedure for the robust cyclic job shop problem
• 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
• Exact solutions for the two-machine robust flow shop with budgeted uncertainty
• Optimal two- and three-stage production schedules with setup times included
• The Price of Robustness
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Constraint programming for the robust two-machine flow-shop scheduling problem with budgeted uncertainty