A Note on Appointment Scheduling with Piecewise Linear Cost Functions

DOI10.1287/moor.2013.0631zbMath1312.90026OpenAlexW2165135667MaRDI QIDQ5247619

Zizhuo Wang, Guohua Wan, Dong-Dong Ge, Jia-Wei Zhang

Publication date: 24 April 2015

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2013.0631

zbMATH Keywords

samplingstochastic programmingschedulingdualityconvex relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46) Stochastic programming (90C15) Combinatorial optimization (90C27) Stochastic scheduling theory in operations research (90B36)

Related Items

M^♮-Convexity and Its Applications in Operations ⋮ Appointment scheduling for multi-stage sequential service systems with limited distributional information ⋮ Appointment scheduling with a quantile objective ⋮ Next-day operating room scheduling with uncertain surgery durations: exact analysis and heuristics ⋮ Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling ⋮ Dynamic scheduling with uncertain job types ⋮ Outpatient appointment systems in healthcare: a review of optimization studies ⋮ Distributionally robust appointment scheduling with moment-based ambiguity set ⋮ Robust Appointment Scheduling with Heterogeneous Costs ⋮ An algorithm for piece-wise indefinite quadratic programming problem ⋮ Appointment sequencing: why the smallest-variance-first rule may not be optimal ⋮ Dynamic multi-priority, multi-class patient scheduling with stochastic service times ⋮ Analysis of models for the stochastic outpatient procedure scheduling problem ⋮ Appointment scheduling for multi-stage sequential service systems with stochastic service durations

Cites Work

• Unnamed Item
• Unnamed Item
• A faster strongly polynomial time algorithm for submodular function minimization
• Operating room planning and scheduling: a literature review
• Weak convergence and empirical processes. With applications to statistics
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Appointment Scheduling with Discrete Random Durations
• Lectures on Stochastic Programming
• Technical Note—A Sampling-Based Approach to Appointment Scheduling
• On Steepest Descent Algorithms for Discrete Convex Functions