A branch-and-price algorithm for the long-term home care scheduling problem

DOI10.1007/978-3-642-29210-1_77zbMath1306.90050OpenAlexW1770811775MaRDI QIDQ5176353

Thomas Sejr Jensen, Mette Gamst

Publication date: 3 March 2015

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/a-branchandprice-algorithm-for-the-longterm-home-care-scheduling-problem(3f37101c-b340-4ac0-be3f-be30f89cc098).html

Mathematics Subject Classification ID

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

Related Items (7)

Home care service planning. The case of Landelijke Thuiszorg ⋮ The home health care problem with working regulations ⋮ A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience ⋮ Pattern-based decompositions for human resource planning in home health care services ⋮ A set partitioning heuristic for the home health care routing and scheduling problem ⋮ Bicriteria vehicle routing problem with preferences and timing constraints in home health care services ⋮ New decomposition methods for home care scheduling with predefined visits

Cites Work

• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
• Delivery strategies for blood products supplies
• An application of special ordered sets to a periodic milk collection problem
• Interior point stabilization for column generation
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem

This page was built for publication: A branch-and-price algorithm for the long-term home care scheduling problem