A Method for Solving the 3-shifts Nurse Scheduling Problem through a General Project Scheduler Based on the Framework of RCPSP/τ

機関リポジトリ Web Site

書誌事項

タイトル別名
  • Method for Solving the 3 shifts Nurse Scheduling Problem through a General Project Scheduler Based on the Framework of RCPSP タウ

この論文をさがす

説明

The Resource-Constrained Project Scheduling Problem (RCPSP) is known to be the framework that can deal with several types of scheduling problems. A number of RCPSP models exist where various constraints were relaxed or added. We develop a general project scheduler based on the framework of RCPSP/τ model which can be applied to various types of scheduling problems. Our scheduler solves such problems as the PSPLIB and the school timetable generation problem by a slight modification in its procedure. In this paper, we solve the nurse scheduling problem (NSP) by our previously proposed scheduler. Especially we deal with 3-shifts NSP of which data is original. Our scheduler can obtain the fusible solution in which all our constraints are satisfied.

収録刊行物

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ