Approach to Nurse Scheduling Problem with Individual Difference of Preference in Work Hours : Application of Genetic Algorithm to Nurse Scheduling Problem : Part I

DOI Web Site 4 Citations 5 References

Bibliographic Information

Other Title
  • 勤務に対する嗜好の個人差を考慮した看護婦スケジューリング : 遺伝アルゴリズムによる看護婦スケジューリング(第一報)
  • 勤務に対する嗜好の個人差を考慮した看護婦スケジューリング--遺伝アルゴリズムによる看護婦スケジューリング(第1報)
  • キンム ニ タイスル シコウ ノ コジンサ オ コウリョシタ カンゴフ スケジ

Search this article

Description

It is important for health care to settle a shortage of nurse these day, since an aging society is just coming in. They are necessary for nurses to reduce nurses' burden of irregular work schedule and to optimize a nurse schedule with each nurse's preference, because nurses' work is too burdensome for nurses to work now. However it is impossible to optimize a surse scheduling problem (NSP) by permutation as NSP is decided under many complex constraint conditions. In this paper, NSP is solved by Genetic Algorithm (GA) that is efficient to such a combined optimization problem. A proposed procedure to NSP takes account of each nurse's preference which has never been studied. Furthermore, the affect to result is investigated with various, parameters which are important in GA to solve such a problem like NSP.

Journal

Citations (4)*help

See more

References(5)*help

See more

Details 詳細情報について

Report a problem

Back to top