Sharif Digital Repository

The nurse scheduling problem is an inevitable issue in managing of hospital wards. Maintaining high quality of working in hospitals is too difficult in tense and high-pressure work environment. Manually solving the scheduling problem is time-consuming. It can pose problems to considering individual excellence, personnel requests and distributing shifts in a fair and desirable manner. These problems and the impossibility of considering all conditions together made the nurse scheduling as an important scheduling problem. In this research we propose a model to assign nurses to shifts considering regulations and hospital’s policies. Unlike nurse scheduling literature we consider nurses... 

In this study, providing home care services by hospitals in the epidemic situations such as COVID-19 is proposed for the first time. Moreover, a mathematical formulation is developed to provide simultaneous decision-making about serving patients without COVID-19, scheduling nurses in the non-COVID-19 wards of hospitals, and scheduling and routing for nurses to serve patients at home. This problem aims to develop essential compatibilities to keep people safe and help continue vital healthcare services during the COVID-19 and similar pandemics. Accordingly, nurses' preferences, the number of available hospital beds, the patient-to-nurse ratio, the Unavailability of some nurses due to COVID-19,... 

Here, we explain an algorithm, recently introduced in the literature, for the personalized nurse scheduling problem. In this algorithm the authors focus on the deterministic counterpart of the specific problem that has been described in the second international nurse rostering competition. One specificity of this version is that most constraints are soft, meaning that they can be violated at the price of a penalty. The problem is modeled as an integer program (IP) and is solved using a branch-and-price procedure. In this model, each column of the IP corresponds to a rotation, i.e., a sequence of consecutive working days for a nurse. In contrast, classical models involve individual nurse... 

The Nurse Scheduling Problem (NSP), is one of the most complicated problem in health care management systems. The problem is to determine a work schedule by considering some requirements such as governmental policies, staff and their managers satisfaction, etc. Nowadays, while the demand of treatment centers for nurses has increased especially in hospitals, the population of qualified nurses has decreased. In such a fuzzy situation, the managers of the treatment centers want a better nurse scheduling in order to increase the quality of giving services to their patients and consequently increase their income. In this thesis, a two-stage nurse scheduling problem with uncertainties in... 

This research intends to investigate the multi-skilled project scheduling problems (MSPSP) considering staffs’ dynamic efficiency. In doing so, a mixed-integer nonlinear programming (MINLP) model is proposed, considering the influence of personnel learning and forgetting on activities duration. The more the staff spends time on their various skills, the more learned and efficient they will be on that skill (according to personal learning curves) so that they can complete new tasks less costly and more quickly. Most project-based organizations want to maximize value by finishing the projects efficiently and developing their staff’s competence through projects. Inherently, any... 

This work attempt to analyze the impact of changes in nurse scheduling on quality of services at emergency department of Emam Khomeini Hospital Complex. In nurse scheduling some constraints such as maximum working hours per week and unacceptable working sequences must be considered. A simulation model is developed to cover the complete flow for the patient through the emergency department. Emergency department of Emam Khomeini is simulated in order to obtain the patient average waiting time for each nurse roster. Then a genetic algorithm is integrated with the simulation model. In each iteration genetic algorithm produces many nurse rosters . For each roster the patient average waiting time... 

Train timetabling is one of the most important problems in the railway scheduling field. It concerns with determining the trians’ arrival and departure times to/from each station so that some constraints are satisfied and some objectives are met. The objective in this thesis is to minimize the summation of dwell times of all trains. The timetables which are offered in this thesis are periodic. It means that each event repeats after a period time. The events are arrivals and departures of trains to/ from stations. In this timetable, the praying constraint is considered as wellso that after Azan time, the train has to dwell in the first station which has enough place for praying. So an integer... 

Nurse scheduling problem has received a great amount of attention during recent years. In this problem number of needed nurses from different skill levels is given for each Location-shift during planning horizon, and the goal is to allocate each nurse to shifts, such that the demand of each location-shift is satisfied. Many researches have been done with the aim of minimizing the number of needed nurses to satisfy the demand of locationshifts or maximizing nurses preferences to work in desired shifts. In this research an integer programming model is proposed to minimize the number of needed nurses and maximize nurses preferences simultaneously. The proposed mathematical model is appropriate...