Nurse scheduling problem (NSPs) represents a diicult class of Multi-objective optimization problems consisting of a number of interfering objectives between the hospitals and individual nurses. The objective of this research is to investigate diiculties that occur during solution of NSP using Evolutionary Algorithms, in particular Genetic Algorithms (GA). As the solution method a population-les...

In this article we present an approach designed to solve a real world problem: the Anesthesiology Nurse Scheduling Problem (ANSP) at a public French hospital. The anesthesiology nurses are one of the most shared resources in the hospital and we attempt to find a fair/balanced schedule for them, taking into account a set of constraints and the nurses’ stated preferences, concerning the different...

Objective: The purpose of this study was to gain insight into nurse managers’ stress experiences and coping strategies in order to better support them. Design: A qualitative exploratory descriptive research design was used in this study. Subject: Fifteen nurse managers participated in this study. Results: Three descriptive themes related to nurse managers’ occupational stress were identified: r...

The problem addressed in this paper is the integrated vehicle-crew-rostering problem (VCRP) aiming to define the schedules for the buses and the rosters for the drivers of a public transit company. The VCRP is described by a bi-objective mixed binary linear programming model with one objective function aggregating vehicle and crew scheduling costs and the other the rostering features. The VCRP ...

The integrated vehicle-crew-roster problem with days-off pattern aims to simultaneously determine minimum cost vehicle and daily crew schedules that cover all timetabled trips and a minimum cost roster covering all daily crew duties according to a pre-defined days-off pattern. This problem is formulated as a new integer linear programming model and is solved by a heuristic approach based on Ben...

In this communication a bi-criterion approach for the nominal Airlines Crew Rostering Problem is developed. The nominal Crew Rostering Problem considers the assignment of the crew staff to a set of pairings covering all the scheduled flights so that operations costs are minimized while its solution must meet hard constraints resulting from the safety regulations of Civil Aviation as well as fro...

Next to fuel costs, crew costs are the largest direct operating cost of airlines. Therefore much research has been devoted to the planning and scheduling of crews over the last thirty years. The planning and scheduling of crews is usually considered as two problems: the crew pairing problem and the crew assignment (rostering) problem. These problems are solved sequentially. In this paper we foc...