Personnel scheduling problems need to cope with personnel preferences, coverage constraints, legal restrictions, and many other constraints. We present a three-stage methodology that can be used to select personnel rosters. In the first stage we generate multiple personnel rosters with a mathematical programming model. In the second stage, the performance of the rosters regarding a number of se...

This paper presents the problem of scheduling security teams to patrol a mass rapid transit rail network of a large urban city. The main objective of patrol scheduling is to deploy security teams to stations at varying time periods of the network subject to rostering as well as security-related constraints. We present a mathematical programming model for this problem. We then discuss the aspect...

Hospital personnel scheduling deals with a large number of constraints of a different nature, some of which need to be satisfied at all costs. It is, for example, unacceptable not to fully support patient care needs and therefore a sufficient number of skilled personnel has to be scheduled at any time. In addition to personnel coverage constraints, nurse rostering problems deal with time relate...

In this study, a computerized nurse-scheduling model is developed. The model is approached through a 0-1 linear goal program. It is adapted to Riyadh Al-Kharj hospital Program (in Saudi Arabia) to improve the current manual-made schedules. The developed model accounts both for hospital objectives and nurses’ preferences, in addition to considering some recommended policies that are displayed in...

A global cardinality constraint (gcc) is speciied in terms of a set of variables X = fx1;:::;xpg which take their values in a subset of V = fv1;:::;vdg. It constrains the number of times each value vi 2 V is assigned to a variable in X to be in an interval li; ui]. A gcc with costs (costgcc) is a generalization of a gcc in which a cost is associated with each value of each variable. Then, each ...

In this paper, we present a scatter search algorithm for the well-known nurse scheduling problem (NSP). This problem aims at the construction of roster schedules for nurses taking both hard and soft constraints into account. The objective is to minimize the total preference cost of the nurses and the total penalty cost from violations of the soft constraints. The problem is known to be NP-hard....

This paper proposes effective genetic operators for cooperative genetic algorithm (GA) to solve a nurse scheduling problem. A clinical director of a medical department makes a duty schedule of all nurses of the department every month. Such the scheduling is very complex task. It takes one or two weeks to create the nurse schedule even by a veteran director. In conventional ways using the cooper...

The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constraint, some of which do not hinder propagation. We prove that, down a branch of a search tree, domain consistency can be enforced on the SEQUENCE constraint in just O(n log n) time. This improves upon the previous bound of O(n) f...

Nurse rostering problems represent a subclass of scheduling problems that are hard to solve. The goal is finding high quality shift and resource assignments, satisfying the needs and requirements of employees as well as the employers in healthcare institutions. In this paper, a real case of a nurse rostering problem is introduced. Memetic Algorithms utilizing different type of promising genetic...

In industry, everybody understands that efficiency of any serious industrial activity is significantly influenced by scheduling. Due to good scheduling the customers can get their ordered goods in time and for reasonable price which is not increased due to extra fee for SKLAD. But scheduling is as important in those types of complex services, which have to be ensured e.g. through cooperation of...