Computing the worst-case due dates violations with budget uncertainty

DOI10.1016/J.ORL.2024.107148MaRDI QIDQ6988618zbMATH OpenFDO

Authors Igor Malheiros, Artur Alves Pessoa, Michael Poss, A. Subramanian

Publication date 3 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107148

zbMATH Keywords

budget uncertaintydeadlinesdue daterelease daterobust optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Robustness in mathematical programming (90C17)

Cites work

• A compact reformulation of the two-stage robust resource-constrained project scheduling problem
• A dynamic programming approach for a class of robust optimization problems
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• Algorithms and complexity analysis for robust single-machine scheduling problems
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Computing robust basestock levels
• JuMP 1.0: recent improvements to a modeling language for mathematical optimization
• Single machine robust scheduling with budgeted uncertainty
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• The robust vehicle routing problem with time windows
• The Vehicle Routing Problem with Release and Due Dates
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows

This page was built for publication: Computing the worst-case due dates violations with budget uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988618)