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

DOI10.1007/S10107-016-0990-XMaRDI QIDQ291063zbMATH OpenOpenAlexFDO

Authors 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

decompositionbranch-and-cutchance-constrained programmingmixed integer linear programmingservice scheduling

Mathematics Subject Classification ID

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

Recommendations

• Integer programming approaches for appointment scheduling with random no-shows and service durations
• Distributionally robust appointment scheduling with moment-based ambiguity set
• An efficient computational method for large scale surgery scheduling problems with chance constraints
• Appointment scheduling with discrete random durations
• Appointment scheduling for multi-stage sequential service systems with stochastic service durations

Cites work

• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
• An integer programming approach for linear programs with probabilistic constraints
• Chance-Constrained Binary Packing Problems
• Covering linear programming with violations
• Decomposition algorithms for two-stage chance-constrained programs
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
• Identifying Minimally Infeasible Subsystems of Inequalities
• Minimizing conditional-value-at-risk for stochastic scheduling problems
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
• On mixing sets arising in chance-constrained programming
• Optimal allocation of surgery blocks to operating rooms under uncertainty
• Sample average approximation method for chance constrained programming: Theory and applications
• Scalable heuristics for a class of chance-constrained stochastic programs
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse

Cited in

(14)

• Distributionally robust appointment scheduling with moment-based ambiguity set
• Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
• Statistical performance of subgradient step-size update rules in Lagrangian relaxations of chance-constrained optimization models
• Time window optimization for attended home service delivery under multiple sources of uncertainties
• Relaxations and approximations of chance constraints under finite distributions
• Appointment scheduling for multi-stage sequential service systems with limited distributional information
• Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data
• Cutting and packing problems under uncertainty: literature review and classification framework
• Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
• ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs
• Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
• Target-Oriented Distributionally Robust Optimization and Its Applications to Surgery Allocation

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

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