LITERATURE REVIEW ON PERSONNEL SCHEDULING

European Journal of Operational Research, 2011

Due to its complexity, its challenging features, and its practical relevance, personnel scheduling has been heavily investigated in the last few decades. However, there is a relatively low level of study on models and complexity in these important problems. In this paper, we present mathematical models which cover specific aspects in the personnel scheduling literature. Furthermore, we address complexity issues by identifying polynomial solvable and NP-hard special cases.

ingenieur.kahosl.be

Proceedings of the 5th …, 2004

Workforce scheduling is known as a complex and highly constraint problem. In the last few years the problem even become more complex due to the deregulation of laws limiting working times, flexibility and opening hours for shops at least in Germany. This paper describes an intelligent workforce scheduling component which shall be incorporated in a commercial workforce planning and scheduling system. Main points are the modelling of the workforce scheduling problem and a heuristic to provide a solution that regards the given hard and soft constraints.

European Journal of Operational Research, 2004

This paper presents a review of staff scheduling and rostering, an area that has become increasingly important as business becomes more service oriented and cost conscious in a global environment.Optimised staff schedules can provide enormous benefits, but require carefully implemented decision support systems if an organisation is to meet customer demands in a cost effective manner while satisfying requirements such as flexible workplace agreements, shift equity, staff preferences, and part-time work. In addition, each industry sector has its own set of issues and must be viewed in its own right. There are many computer software packages for staff scheduling, ranging from spreadsheet implementations of manual processes through to mathematical models using efficient optimal or heuristic algorithms. We do not review software packages in this paper. Rather, we review rostering problems in specific application areas, and the models and algorithms that have been reported in the literature for their solution. We also survey commonly used methods for solving rostering problems.

HAL (Le Centre pour la Communication Scientifique Directe), 2009

Our application is placed in the domain of automatic generation of timetables. The generation of timetables is the assignment of employees to tasks in the goal of schedule during one fixed period, in general a week. This problem is by its nature a complex problem which requires the resolution of many constraints. Indeed, the SSP are usually addressed to the organization where a set of tasks must be achieved by a group of employees having their own qualifications, constraints and preferences. The organization imposes total regulations and tries to carry out such total objectives them such as the reduction of the total cost or the equitable division of the load of work between the employees. Research in this field gave place to several conference. The results resulting often are adapted to particular professional sectors. In this paper, we propose a general solution not depending on particular sector.

INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY, 2014

Personnel Scheduling or rostering problem is an assignment of shifts to employees. An efficient way of crew scheduling can save the scheduling cost for an organizations by means of using minimum manpower. And mostly cost incurred is due to employees assigned for performing a given task so this cost can be saved by optimizing the process of personnel scheduling. This paper describes a tabu search based heuristic algorithm which is applied on bus driver scheduling problem. Solution to this problem is an assignment of duties such that each employee should know when to work and also which task to perform while working. Finding the solution of this problem is minimization of the overall employees needed to cover all the shifts in the schedule and total service time and total scheduling cost while satisfying all the constraints

Workforce scheduling has become increasingly important for both the public sector and private companies. Good rosters have many benefits for an organization, such as lower costs, more effective utilization of resources and fairer workloads and distribution of shifts. This paper summarizes our work with workforce scheduling. The paper presents the workforce scheduling process and examples of real-world instances which are solved using the PEAST algorithm. The workforce scheduling process includes seven phases: workload prediction, preference scheduling, shift generation, days-off scheduling, resource analysis, partitioning and staff rostering. The PEAST algorithm is used to solve all the phases of the workforce scheduling process. The PEAST algorithm has been successfully used to solve workforce scheduling problems in Finnish companies. The algorithm has been integrated into market-leading workforce management software in Finland.

This article presents a literature review of the current state of staff scheduling, in particular nurse scheduling. In current health care service, the critical problem in nurse scheduling in a hospital is how to determine day-to-day shift assignments of each nurse for a period of time in a way that satisfies the given requirements of a hospital. As a basis, the formal analysis of the problem is performed and a general scheduling procedure was established. Based on the method, a word processing template or software system which produces a scheduling program for a given institution was developed. Another objective of scheduling is optimization. Optimization of personnel scheduling consists of the selection of those work patterns that meet total work requirements at the lowest cost. Various approaches to alleviate the scheduling quagmire while attaining optimization are presented in this paper. Analysis of each of these approaches along with their effectiveness is presented. We anticipate that one of these approaches researched will provide the backbone to develop a system suitable for use at Duke University's medical oncology department.

Brazilian Journal of Operations & …, 2010

In this paper we present a heuristic approach for solving workforce scheduling problems. The primary goal is to minimize the number of required workers given a pre-established shift demand over a planning horizon. The proposed algorithm starts with an initial solution (initial number of workers and their shift assignment) and iteratively searches the state space, moving towards better solutions via a local search procedure. Local optima are avoided by guaranteeing that the algorithm never returns to a previously visited solution. The algorithm stops after a termination criterion is met. The solution provides a detailed schedule of each worker on each shift. A number of constraints such as minimum and maximum number of working hours, rest days, and maximum number of continuous working hours are considered. The algorithm was tested on a number of randomly generated problems of different sizes. A Mixed Integer Programming (MIP) formulation is proposed and used as a benchmark. Computational experiments show that the algorithm always found optimal or near-optimal solutions with signifi cantly less computer effort.