Home service routing and appointment scheduling with stochastic service times

DOI10.1016/J.EJOR.2020.05.037zbMath1487.90198OpenAlexW3032462496MaRDI QIDQ2028845

Guohua Wan, Yang Zhan, Zizhuo Wang

Publication date: 3 June 2021

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

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

zbMATH Keywords

stochastic optimizationtraveling salesman problemOR in service industriesappointment schedulinghome services

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Dynamic routing-scheduling problem for home health care considering caregiver-patient compatibility ⋮ Data-driven integrated home service staffing and capacity planning: stochastic optimization approaches ⋮ Adaptive appointment scheduling with periodic updates ⋮ Adaptive scheduling in service systems: a dynamic programming approach ⋮ Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times ⋮ Home healthcare staff dimensioning problem for temporary caregivers: a matheuristic solution approach ⋮ Robust homecare service capacity planning ⋮ A survey of attended home delivery and service problems with a focus on applications ⋮ Stochastic joint homecare service and capacity planning with nested decomposition approaches ⋮ Time window optimization for attended home service delivery under multiple sources of uncertainties

Cites Work

• Unnamed Item
• Unnamed Item
• The discrete time window assignment vehicle routing problem
• A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
• The vehicle routing problem with flexible time windows and traveling times
• Proximity control in bundle methods for convex nondifferentiable minimization
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
• Operating room planning and scheduling: a literature review
• The traveling salesman problem: An overview of exact and approximate algorithms
• New optimality cuts for a single-vehicle stochastic routing problem
• Home health care routing and scheduling: a review
• Appointment scheduling and routing optimization of attended home delivery system with random customer behavior
• Appointment scheduling with multiple providers and stochastic service times
• Vehicle routing and appointment scheduling with team assignment for home services
• Sequencing and scheduling \(N\) customers for a stochastic server
• The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
• Appointment scheduling for multi-stage sequential service systems with stochastic service durations
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Lectures on Stochastic Programming
• A regularized decomposition method for minimizing a sum of polyhedral functions
• A stochastic integer programming approach to solving a synchronous optical network ring design problem
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming

This page was built for publication: Home service routing and appointment scheduling with stochastic service times