Guided complete search for nurse rostering problems
Refereed conference paper presented and published in conference proceedings

Times Cited
Altmetrics Information

Other information
AbstractNurse rostering problem is one of the most difficult scheduling problems in artificial intelligence and operation research. In general, it consists of cardinality constraints and special pattern constraints that correspond to the given workforce demands, which form a complex problem structure. Many heuristics algorithms have been proposed to solve this particular problem. In this paper, we demonstrate the efficiency of our newly defined GCS/Simplex solver, which incorporates Simplex method into the GCS framework, on some difficult nurse rostering problem instances. Experimental results show that the GCS/Simplex solver is efficient in solving this kind of scheduling problems in terms of both computation time and number of fails. © 2005 IEEE.
All Author(s) ListFung S.K.L., Leung H.-F., Lee J.H.M.
Name of ConferenceICTAI 2005: 17th IEEE International Conference on Tools with Artificial Intelligence, ICTAI'05
Start Date of Conference14/11/2005
End Date of Conference16/11/2005
Place of ConferenceHong Kong
Country/Region of ConferenceHong Kong
Volume Number2005
Pages706 - 707
LanguagesEnglish-United Kingdom

Last updated on 2021-14-05 at 00:17