메뉴 건너뛰기




Volumn 17, Issue 6, 2004, Pages 599-610

Constraint-based rostering using meta-level reasoning and probability-based ordering

Author keywords

Constraint generation; Constraint programming; Nurse rostering; Search heuristics

Indexed keywords

ALGORITHMS; BENCHMARKING; CONSTRAINT THEORY; HEURISTIC METHODS; PROBABILITY; PROBLEM SOLVING;

EID: 5444246205     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2004.08.001     Document Type: Article
Times cited : (10)

References (32)
  • 1
    • 0000684545 scopus 로고    scopus 로고
    • Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
    • Aiclelin, U., Dowsland, K., 2001. Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling 3 (3), 139-153.
    • (2001) Journal of Scheduling , vol.3 , Issue.3 , pp. 139-153
    • Aiclelin, U.1    Dowsland, K.2
  • 3
    • 84956861632 scopus 로고    scopus 로고
    • A hybrid tabu search algorithm for the nurse rostering problem
    • Xao, et al. (Eds.), SEAL'98. Springer, Berlin, Heidelberg
    • Burke, E., Causmaecker, P.D., Berghe, G.V., 1999. A hybrid tabu search algorithm for the nurse rostering problem. In: Xao, et al. (Eds.), SEAL'98, LNCS 1585. Springer, Berlin, Heidelberg, pp. 187-194.
    • (1999) LNCS , vol.1585 , pp. 187-194
    • Burke, E.1    Causmaecker, P.D.2    Berghe, G.V.3
  • 9
    • 0041377554 scopus 로고
    • Network-based heuristics for constraint-satisfaction problems
    • Kanal, L., Kumar, V. (Eds.). Springer, New York
    • Dechter, R., Pearl, J., 1988. Network-based heuristics for constraint-satisfaction problems. In: Kanal, L., Kumar, V. (Eds.), Search in Artificial Intelligence. Springer, New York, pp. 370-425.
    • (1988) Search in Artificial Intelligence , pp. 370-425
    • Dechter, R.1    Pearl, J.2
  • 10
    • 0032048428 scopus 로고    scopus 로고
    • Nurse scheduling with tabu search and strategic oscillation
    • Dowsland, K.A., 1998. Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research 106, 393-407.
    • (1998) European Journal of Operational Research , vol.106 , pp. 393-407
    • Dowsland, K.A.1
  • 11
    • 0041508106 scopus 로고
    • Backtrack-free and backtrack-bounded search
    • Kanal, L., Kumar, V. (Eds.). Springer, New York
    • Freuder, E., 1988. Backtrack-free and backtrack-bounded search. In: Kanal, L., Kumar, V. (Eds.), Search in Artificial Intelligence. Springer, New York, pp. 343-369.
    • (1988) Search in Artificial Intelligence , pp. 343-369
    • Freuder, E.1
  • 12
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers, Kluwer
    • Glover, F., Laguna, M., 1997. Tabu Search. Kluwer Academic Publishers, Kluwer. http://www.ilog.com/.
    • (1997) Tabu Search
    • Glover, F.1    Laguna, M.2
  • 16
    • 0002514541 scopus 로고
    • Algorithms for constraint satisfaction problems: A survey
    • Kumar, V., 1992. Algorithms for constraint satisfaction problems: a survey. AI Magazine 13 (1), 32-44.
    • (1992) AI Magazine , vol.13 , Issue.1 , pp. 32-44
    • Kumar, V.1
  • 18
    • 49449120803 scopus 로고
    • Consistency in networks of relations
    • Mackworth, A.K., 1977. Consistency in networks of relations. Artificial Intelligence 8 (1), 99-118.
    • (1977) Artificial Intelligence , vol.8 , Issue.1 , pp. 99-118
    • Mackworth, A.K.1
  • 19
    • 0021828305 scopus 로고
    • The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
    • Mackworth, A.K., Freuder, E.C., 1985. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25, 65-74.
    • (1985) Artificial Intelligence , vol.25 , pp. 65-74
    • Mackworth, A.K.1    Freuder, E.C.2
  • 20
    • 0016994376 scopus 로고
    • Nurse scheduling using mathematical programming
    • Miller, H.E., 1976. Nurse scheduling using mathematical programming. Operations Research 24 (8), 857-870.
    • (1976) Operations Research , vol.24 , Issue.8 , pp. 857-870
    • Miller, H.E.1
  • 22
    • 0024071270 scopus 로고
    • Goal programming model subsystem of a flexible nurse scheduling support system
    • Ozkarahan, Bailey, J., 1988. Goal programming model subsystem of a flexible nurse scheduling support system. HE Transactions 20 (3), 306-316.
    • (1988) HE Transactions , vol.20 , Issue.3 , pp. 306-316
    • Ozkarahan1    Bailey, J.2
  • 25
    • 0034308310 scopus 로고    scopus 로고
    • Hybrid optimization techniques for the work-shift and rest assignment of nursing personnel
    • Valouxis, C., Housos, E., 2000. Hybrid optimization techniques for the work-shift and rest assignment of nursing personnel. Artificial Intelligence in Medicine 20, 155-175.
    • (2000) Artificial Intelligence in Medicine , vol.20 , pp. 155-175
    • Valouxis, C.1    Housos, E.2
  • 26
  • 27
    • 0016993816 scopus 로고
    • Scheduling nursing personnel according to nursing preference: A mathematical programming approach
    • Warner, D.M., 1976. Scheduling nursing personnel according to nursing preference: a mathematical programming approach. Operations Research 24 (8), 842-856.
    • (1976) Operations Research , vol.24 , Issue.8 , pp. 842-856
    • Warner, D.M.1


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