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

Mette Gamst, Thomas Sejr Jensen

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    607 Downloads (Pure)

    Abstract

    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
    Publication statusPublished - 2012
    EventInternational Conference on Operations Research - Zürich, Switzerland
    Duration: 30 Aug 20112 Sept 2011
    http://www.or2011.ch/index

    Conference

    ConferenceInternational Conference on Operations Research
    Country/TerritorySwitzerland
    CityZürich
    Period30/08/201102/09/2011
    Internet address
    SeriesOperations Research Proceedings
    ISSN0721-5924

    Fingerprint

    Dive into the research topics of 'A branch-and-price algorithm for the long-term home care scheduling problem'. Together they form a unique fingerprint.

    Cite this