This paper describes an employee scheduling system for retail outlets; it is a constraint-
based system that exploits forecasts and stochastic techniques to generate schedules …

This paper studies the personnel staffing decision accounting for the planning of workforce
training and the inclusion of learning and forgetting, which dynamically change the …

Shift scheduling problems (SSPs) are advanced NP-hard problems which are generally
evaluated with integer programming. This study presents an applicable shift schedule of …

Many researchers have studied optimization problems with soft and hard constraints, such
as school timetabling, nurse rostering, vehicle routing with soft time window, and …

During peacetime, the missile boat squadron possesses rapidly deployable capacities for
crisis response. The squadron conducts maritime reconnaissance and patrolling …

In this paper, we study the personnel task rescheduling problem with time preemption. We
assume a baseline task schedule has been composed some time in advance that has been …

In many professions the demand for work requires employees to work in different shifts to
cover varying requirements including areas like health care, protection services …

In dealing with personnel management in companies, two fundamental planning issues
have to be handled: staff rostering and activities assignment. These two problems have …

Due to the computational complexity, the staff scheduling problem is generally decomposed
into two subproblems, ie staff rostering and task assignment problems. Very often, this could …

Real world combinatorial optimisation problems do not often reduce to neatly delineated
theoretical problems. Rather, they combine characteristics of various subproblems which …