نتایج جستجو برای: nurse scheduling problem

تعداد نتایج: 952579  

2014
Kenya V. Beard

Objective: Faculty who are aware of culturally responsive practices are better positioned to implement teaching-learning strategies that meet the educational needs of culturally diverse learners. This study investigated the extent to which faculty used practices that promoted the academic success of African American and Hispanic minority nursing students and their preparedness in teaching these...

Journal: :Annals OR 2012
Patrick De Causmaecker Greet Vanden Berghe

Timetabling and rostering research often starts from particular real world problems. The last two decennia have seen a large number of papers discussing cases, models and approaches. This large body of papers does not presently consitute a structured domain that provides guidelines for addressing particular problem instances, nor does it allow identifying gaps where new research is needed. In t...

2007
Abraham Diskin Dan S. Felsenthal

We argue that Nash’s solution to the bargaining problem should be modified such that it will be based on a New Reference Point (NRP). Such a point is needed so that a player is not considered ‘individually rational’ if he accepts an agreement that provides him with a utility lower than the minimal utility he can derive from any Pareto optimal agreement, or if he accepts an agreement that provid...

Journal: :Algorithms 2013
Ioannis P. Solos Ioannis X. Tassopoulos Grigorios N. Beligiannis

In this contribution, a generic two-phase stochastic variable neighborhood approach is applied to nurse rostering problems. The proposed algorithm is used for creating feasible and efficient nurse rosters for many different nurse rostering cases. In order to demonstrate the efficiency and generic applicability of the proposed approach, experiments with real-world input data coming from many dif...

2004
Hiromitsu Hattori Toramatsu Shintani Atsushi Isomura Takayuki Ito Tadachika Ozono

The real-life scheduling problems are often over-constrained, and there is often one intractable case where unexpected events are added and a sudden change is required. In this paper, we describe such problems as the Dynamic Valued Constraint Satisfaction Problem (DyVCSP). In DyVCSP, although the previous schedule would be modified when there is some change, the new schedule should be similar t...

2012
Xu Mai

Purpose -Nurse scheduling problem is a key issue in strategic management in healthcare institutes. To improve the current manual-made nurse schedule, this paper presents a hybrid heuristic approach to generate weekly nurse schedule for a local Emergency Department (ED) in Hong Kong. Design/methodology/approach -A two-stage method is developed for the above purpose. In the first stage, approve-i...

Journal: :Advances in transdisciplinary engineering 2023

Nurse scheduling is a topic widely studied due to its overall effect on patient care and hospital performance. This research focuses formulating Mixed Integer Programming (MIP) workforce model as nurse rostering problem. The incorporates multiple objectives of individual preference qualification. approached by categorizing nurses into different hierarchical levels based their qualifications pos...

2017
Ademir A. Constantino Everton Luiz de Melo Dario Landa-Silva

This paper tackles the nurse scheduling problem with balanced preference satisfaction which consists of generating an assignment of shifts to nurses over a given time horizon and ensuring that the satisfaction of nurses’ personal preferences for shifts is as even as possible in order to ensure fairness. We propose a heuristic algorithm based on successive resolutions of the bottleneck assignmen...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید