Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints

DOI10.1007/s10107-016-0990-xzbMath1347.90062OpenAlexW2187204135MaRDI QIDQ291063

Yan Deng, Siqian Shen

Publication date: 6 June 2016

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-016-0990-x

zbMATH Keywords

decompositionchance-constrained programmingmixed integer linear programmingbranch-and-cutservice scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15)

Related Items (11)

ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs ⋮ Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ Relaxations and approximations of chance constraints under finite distributions ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ Cutting and packing problems under uncertainty: literature review and classification framework ⋮ Target-Oriented Distributionally Robust Optimization and Its Applications to Surgery Allocation ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Distributionally robust appointment scheduling with moment-based ambiguity set ⋮ Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data ⋮ Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs ⋮ Time window optimization for attended home service delivery under multiple sources of uncertainties

Cites Work

• Unnamed Item
• Decomposition algorithms for two-stage chance-constrained programs
• Minimizing conditional-value-at-risk for stochastic scheduling problems
• A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• An integer programming approach for linear programs with probabilistic constraints
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
• Sample average approximation method for chance constrained programming: Theory and applications
• On mixing sets arising in chance-constrained programming
• Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs
• Chance-Constrained Binary Packing Problems
• Covering Linear Programming with Violations
• Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• Identifying Minimally Infeasible Subsystems of Inequalities

This page was built for publication: Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints