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

Publication: Research - peer-review › Article in proceedings – Annual report year: 2012

External

Standard

A branch-and-price algorithm for the long-term home care scheduling problem. / Gamst, Mette; Jensen, Thomas Sejr.

In: Operations Research Proceedings 2011: Selected Papers of the International Conference on Operations Research. ed. / Diethard Klatte; Hans-Jakob Lüthi; Karl Schmedders. Springer, 2012. p. 483-488 (Operations Research Proceedings).

Publication: Research - peer-review › Article in proceedings – Annual report year: 2012

Harvard

Gamst, M & Jensen, TS 2012, 'A branch-and-price algorithm for the long-term home care scheduling problem'. D Klatte, H-J Lüthi & K Schmedders (eds), in: Operations Research Proceedings 2011: Selected Papers of the International Conference on Operations Research. Springer, pp. 483-488. Operations Research Proceedings

APA

Gamst, M., & Jensen, T. S. (2012). A branch-and-price algorithm for the long-term home care scheduling problem. Klatte, D., Lüthi, H-J., & Schmedders, K. (Eds.), In: Operations Research Proceedings 2011: Selected Papers of the International Conference on Operations Research. (pp. 483-488). Springer. (Operations Research Proceedings).

CBE

Gamst M, Jensen TS. 2012. A branch-and-price algorithm for the long-term home care scheduling problem. Klatte D, Lüthi H-J, Schmedders K, editors. In Operations Research Proceedings 2011: Selected Papers of the International Conference on Operations Research. Springer. pp. 483-488. (Operations Research Proceedings).

MLA

Gamst, Mette and Thomas SejrJensen "A branch-and-price algorithm for the long-term home care scheduling problem"., Klatte, Diethard Lüthi, Hans-Jakob Schmedders, Karl (ed.). In: Operations Research Proceedings 2011: Selected Papers of the International Conference on Operations Research. Springer. 2012. 483-488. (Operations Research Proceedings).

Vancouver

Gamst M, Jensen TS. A branch-and-price algorithm for the long-term home care scheduling problem. Klatte D, Lüthi H-J, Schmedders K, editors. In: Operations Research Proceedings 2011: Selected Papers of the International Conference on Operations Research. Springer. 2012. p. 483-488. (Operations Research Proceedings).

Author

Gamst, Mette; Jensen, Thomas Sejr / A branch-and-price algorithm for the long-term home care scheduling problem.

Publication: Research - peer-review › Article in proceedings – Annual report year: 2012

Bibtex

@inbook{3f37101cb3404ac0be3fbe30f89cc098,

title = "A branch-and-price algorithm for the long-term home care scheduling problem",

publisher = "Springer",

author = "Mette Gamst and Jensen, {Thomas Sejr}",

year = "2012",

editor = "Diethard Klatte and Hans-Jakob Lüthi and Karl Schmedders",

isbn = "978-3-642-29209-5",

series = "Operations Research Proceedings",

pages = "483-488",

booktitle = "Operations Research Proceedings 2011",

}

RIS

TY - GEN

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

A1 - Gamst,Mette

A1 - Jensen,Thomas Sejr

AU - Gamst,Mette

AU - Jensen,Thomas Sejr

PB - Springer

PY - 2012

Y1 - 2012

N2 - 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<br/>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.

AB - 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<br/>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.

UR - http://www.or2011.ch/index

U2 - 10.1007/978-3-642-29210-1_77

DO - 10.1007/978-3-642-29210-1_77

SN - 978-3-642-29209-5

BT - Operations Research Proceedings 2011

T2 - Operations Research Proceedings 2011

A2 - Schmedders,Karl

ED - Schmedders,Karl

T3 - Operations Research Proceedings

T3 - en_GB

SP - 483

EP - 488

ER -