Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty

DOI10.1016/j.ejor.2019.10.037zbMath1431.90070OpenAlexW2982485277WikidataQ126853089 ScholiaQ126853089MaRDI QIDQ2286919

Marco Silva, Michael Poss, Nelson F. Maculan

Publication date: 23 January 2020

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

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

zbMATH Keywords

integer programmingbranch-and-boundrobust optimizationscheduling problemrow-and-column generation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ Exact solutions for the two-machine robust flow shop with budgeted uncertainty ⋮ 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 ⋮ A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty

Cites Work

• Unnamed Item
• Dominance rules in combinatorial optimization problems
• On the robust single machine scheduling problem
• Algorithms and complexity analysis for robust single-machine scheduling problems
• Complexity of single machine scheduling problems under scenario-based uncertainty
• The single-machine total tardiness scheduling problem: review and extensions
• Adjustable robust solutions of uncertain linear programs
• Solution of the single machine total tardiness problem
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope
• A decomposition algorithm for the single machine total tardiness problem
• An exact algorithm for single-machine scheduling without machine idle time
• Robust scheduling with budgeted uncertainty
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Robust Scheduling with Logic-Based Benders Decomposition
• A Dynamic Programming Approach for a Class of Robust Optimization Problems
• Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
• A new decomposition approach for the single machine total tardiness scheduling problem
• Approximating Single Machine Scheduling with Scenarios
• The Price of Robustness
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Minimizing Total Costs in One-Machine Scheduling
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Benchmarking optimization software with performance profiles.

This page was built for publication: Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty