메뉴 건너뛰기




Volumn 175, Issue 1, 2006, Pages 258-278

Scheduling trainees at a hospital department using a branch-and-price approach

Author keywords

Branch and price; Integer programming; OR in health services; Scheduling

Indexed keywords

HOSPITALS; INTEGER PROGRAMMING; OPERATIONS RESEARCH; OPHTHALMOLOGY; PROBLEM SOLVING; STUDENTS; SURGERY;

EID: 33749146738     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.04.028     Document Type: Article
Times cited : (47)

References (24)
  • 1
    • 0000684545 scopus 로고    scopus 로고
    • Exploiting problem structure in a genetic algorithms approach to a nurse rostering problem
    • Aickelin U., and Dowsland K.A. Exploiting problem structure in a genetic algorithms approach to a nurse rostering problem. Journal of Scheduling 31 (2000) 139-153
    • (2000) Journal of Scheduling , vol.31 , pp. 139-153
    • Aickelin, U.1    Dowsland, K.A.2
  • 4
  • 5
    • 33749146357 scopus 로고    scopus 로고
    • Beliën, J., Demeulemeester, E., 2004. Scheduling trainees at a hospital department using a branch-and-price approach. Research Report OR 0403, Katholieke Universiteit Leuven, Department of Applied Economics.
  • 6
    • 85012688561 scopus 로고
    • Princeton University Press, Princeton, NJ
    • Bellman R. Dynamic programming (1957), Princeton University Press, Princeton, NJ
    • (1957) Dynamic programming
    • Bellman, R.1
  • 7
    • 0035111024 scopus 로고    scopus 로고
    • Enhancing constraint logic programming branch and bound techniques for scheduling problems
    • Bosi F., and Milano M. Enhancing constraint logic programming branch and bound techniques for scheduling problems. Software Practice and Experience 31 (2001) 17-42
    • (2001) Software Practice and Experience , vol.31 , pp. 17-42
    • Bosi, F.1    Milano, M.2
  • 8
    • 0027543260 scopus 로고
    • A simulated annealing approach to the cyclic staff-scheduling problem
    • Brusco M.J., and Jacobs L.W. A simulated annealing approach to the cyclic staff-scheduling problem. Naval Research Logistics 40 (1993) 69-84
    • (1993) Naval Research Logistics , vol.40 , pp. 69-84
    • Brusco, M.J.1    Jacobs, L.W.2
  • 9
    • 84956861632 scopus 로고    scopus 로고
    • Burke, E.K., De Causmaecker, P., Vanden Berghe, G., 1998. A hybrid tabu search algorithm for the nurse rostering problem. In: Selected Papers from the 2nd Asia Pacific Conference on Simulated Evolution and Learning. pp. 187-194.
  • 10
    • 33749122084 scopus 로고    scopus 로고
    • Cappanera, P., Gallo, G., 2001. A multi-commodity flow approach to the crew rostering problem. Technical Report TR-01-08, Dip. di Informatica, Univ. di Pisa.
  • 14
    • 33749119828 scopus 로고    scopus 로고
    • Hans, E.W., 2001. Resource loading by branch-and-price techniques. Ph.D. Dissertation, Twente University Press, Enschede, The Netherlands.
  • 16
    • 84957088938 scopus 로고    scopus 로고
    • Computing the k shortest paths: A new algorithm and an experimental comparison
    • Vitter J.S., and Zaroliagis C.D. (Eds), Springer-Verlag, Berlin
    • Jiménez V.M., and Marzal A. Computing the k shortest paths: A new algorithm and an experimental comparison. In: Vitter J.S., and Zaroliagis C.D. (Eds). Lecture Notes in Computer Science Series (1999), Springer-Verlag, Berlin 15-29
    • (1999) Lecture Notes in Computer Science Series , pp. 15-29
    • Jiménez, V.M.1    Marzal, A.2
  • 17
    • 4043077738 scopus 로고    scopus 로고
    • A nested column generator for solving rostering problems with integer programming: Techniques and applications
    • Mason A.J., and Smith M.C. A nested column generator for solving rostering problems with integer programming: Techniques and applications. International Conference on Optimisation (1998) 827-834
    • (1998) International Conference on Optimisation , pp. 827-834
    • Mason, A.J.1    Smith, M.C.2
  • 18
  • 20
    • 11844270172 scopus 로고    scopus 로고
    • Combining column generation and Lagrangian relaxation to solve a single-machine common due date problem
    • Van den Akker M., Hoogeveen H., and van de Velde S.L. Combining column generation and Lagrangian relaxation to solve a single-machine common due date problem. INFORMS Journal on Computing 14 (2002) 37-51
    • (2002) INFORMS Journal on Computing , vol.14 , pp. 37-51
    • Van den Akker, M.1    Hoogeveen, H.2    van de Velde, S.L.3
  • 21
    • 0033725783 scopus 로고    scopus 로고
    • On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm
    • Vanderbeck F. On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Operations Research 48 (2000) 111-128
    • (2000) Operations Research , vol.48 , pp. 111-128
    • Vanderbeck, F.1
  • 23
    • 0016993816 scopus 로고
    • Scheduling nursing personnel according to nursing preferences: A mathematical programming approach
    • Warner D.M. Scheduling nursing personnel according to nursing preferences: A mathematical programming approach. Operations Research 24 (1976) 842-856
    • (1976) Operations Research , vol.24 , pp. 842-856
    • Warner, D.M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.