Optimization of Nurse Scheduling Problem with a Two-Stage Mathematical Programming Model

Chang-Chun Tsai ； Cheng-Jung Lee

《Asia Pacific Management Review》 15卷4期 (2010/12) Pp. 503-516

https://doi.org/10.6126/APMR.2010.15.4.02

並列摘要

This paper constructs a two-stage mathematical programming model to solve the nurse scheduling problem in order to assign nurses to shifts over a scheduling period so that certain constraints (organizational and personal) are satisfied. In the first stage, the nurse optimal vacation schedules are solved by a self-schedule programming that can check for any violation of government regulations, hospital management requirements, and scheduling fairness. In the second stage, the nurse roster schedule is arranged and a Genetic Algorithm (GA) is further adopted to derive the optimal schedule. An empirical case study is performed and the results show that the proposed approach can solve the nurse scheduling problem efficiently. In addition, it can also be easily modified to suit different cases encountered in hospitals.

並列關鍵字

International mathematical programming model ； genetic algorithm ； self-schedule ； nurse scheduling

參考文獻

Abbott, M. E.(1995).Measuring the effects of a self-scheduling committee.Nursing Management.26(9),64a-64g.

Ahuja, H.,Sheppard, R.(1975).Computerized nurse scheduling.Industrial Engineering.7(10),24-29.

Aickelin, U.,Dowsland, K.(2000).Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem.Journal of Scheduling.3(3),139-153.

Pelican, M.(ed.),Sastry, K.(ed.),Cantú-Paz, E.(ed.)(2006).Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications.New York:Springer.

Arther, J. L.,Ravindran, A.(1981).A multiple objective nurse scheduling model.AIIE Transaction.13(1),56-60.