Personnel Scheduling in Laboratories

We describe an assignment problem particular to the personnel scheduling of organisations such as laboratories. Here we have to assign tasks to employees. We focus on the situation where this assignment problem reduces to constructing maximal matchings in a set of interrelated bipartite graphs. We describe in detail how the continuity of tasks over the week is achieved to suit the wishes of the planner. Finally, we discuss the implementation of the algorithm in the package IPS. Its main characteristic is the introduction of profiles, which easily allows the user to steer the algorithm