Abstract
Efficient utilization of time and effort is essenti al in Personnel scheduling problems to evenly balan ce the workload among the people and attempt to satisfy th e personnel preferences. In Constraint Satisfaction Problem based scheduling problems, when a branch of the search fails the backtracking search algorithm back up to the preceding variable and try a differe nt value for it. So here the most recent decision p oint is revisited. Its run-time complexity for most nontriv ial problems is still exponential. A solution is in telligent backtracking scheme in which backtracking is done directly to the variable that caused the failure. Th is study proposes Constraint Satisfaction Problem base d Nurse Rostering using Intelligent Backtracking approach. The proposed Minimal Critical Set based I ntelligent Backtracking (MCS-IBT) algorithm incorporates Critical Set detection which is follow ed by Minimal Critical Set reduction in order to re duce the search space for nurse rostering. MCS_IBT overcomes missing good MCSs by visiting optimal number of sets. This study finds its applications in sched uling, temporal reasoning, graph problems, floor pl an design, the planning of genetic experiments and the satisfiability problems. The implemented system is tested on the real life data from the hospital and the results shown remarkable performance.
Highlights
A finite and discrete domain for each variable and a set of constraints
This study proposes Constraint Satisfaction Problem based Nurse Rostering using Intelligent Backtracking approach
The proposed Minimal Critical Set based Intelligent Backtracking (MCS-IBT) algorithm incorporates Critical Set detection which is followed by Minimal Critical Set reduction in order to reduce the search space for nurse rostering
Summary
A finite and discrete domain for each variable and a set of constraints. Each constraint is defined over some subset. Nurse Rostering is a complex scheduling problem that affects hospital personnel on a daily basis all over of the original set of variables and limits the combinations of values that the variables in this subset the world. Nurse Rostering is defined as the process of generating timetables for specifying the work shifts of can take. The goal is to find one assignment to the variables such that the assignment satisfies all the nurses over a given period of time. The goal is to find all such for Nurse Rostering are Mathematical programming, assignments. Declarative and constraint programming and meta-heuristics approaches. The search technique is generated as the search progresses and represents alternative choices that can be
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
