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

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2012

Documents

DOI

View graph of relations

In several countries, home care is provided for certain citizens living at home. The long-term home care scheduling problem is to generate work plans such that a high quality of service is maintained, the work hours of the employees are respected, and the overall cost is kept as low as possible. We propose a branchand-price algorithm for the long-term home care scheduling problem. The pricing
problem generates a one-day plan for an employee, and the master problem merges the plans with respect to regularity constraints. The method is capable of generating plans with up to 44 visits during one week.
Original languageEnglish
Title of host publicationOperations Research Proceedings 2011 : Selected Papers of the International Conference on Operations Research
EditorsDiethard Klatte, Hans-Jakob Lüthi, Karl Schmedders
Number of pages6
PublisherSpringer
Publication date2012
Pages483-488
ISBN (print)978-3-642-29209-5
ISBN (electronic)978-3-642-29210-1
DOIs
StatePublished

Conference

ConferenceInternational Conference on Operations Research
CountrySwitzerland
CityZürich
Period30/08/1102/09/11
Internet addresshttp://www.or2011.ch/index
NameOperations Research Proceedings
ISSN (Print)0721-5924
CitationsWeb of Science® Times Cited: 1
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 12377280