Self-rostering is receiving more and more attention in literature and in practice. With self-rostering, employees propose the schedule they prefer to work during a given planning horizon. However, these schedules often do not match with the staffing demand as specified by the organization. We present an approach to support creating feasible schedules that uses the schedules proposed by the empl...

References [1] S Abdennadher and H Schlenker. INTERDIP – an interactive constraint based nurse scheduler. [2] J L Arthur and A Ravindran. A multiple objective nurse scheduling model. A multi-objective approach to nurse scheduling with both hard and soft constraints. [10] R N Burns and M W Carter. Work force size and single shift schedules with variable demands. [12] K A Dowsland and J M Thompso...

Operation rooms are significant cost drivers in hospitals. This is because of the expensive resources that are directly involved in surgery, and the indirect impact that operating room activities have on related activities and resources throughout the hospital. Surgery planning on different levels and time scales are thus central planning problems with strong interactions with other planning pr...

Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be acceptable. Recent research has shown that constraint weighting local search algorithms can be very effective in solving a variety of CSPs. However, little work has been done in applying such algorithms to over-constrai...

Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be acceptable. Recent research has shown that constraint weighting local search algorithms can be very effective in solving a variety of CSPs. However, little work has been done in applying such algorithms to over-constrai...

In most real world optimization problems several optimization goals have to be considered in parallel. For this reason, there has been a growing interest in Multi-Objective Optimization (MOO) in the past years. Several alternative approaches have been proposed to cope with the occurring problems, e.g. how to compare and rank the different elements. The available techniques produce very good res...

Airline crew rostering is the assignment problem of crew members to planned rotations/pairings for certain month. Airline companies have the monthly task of constructing personalized monthly schedules (roster) for crew members. This problem increased more and more complex and difficult while the aspirations/criterias grew to assess the quality of roster and the constraints increased excessively...

This paper presents an integer programming formulation for integrating maintenance planning tasks in the railway rolling stock circulation problem. This is a key problem in railway rostering planning that requires to cover a given set of services and maintenance works with a minimum amount of rolling stock units. An additional objective is to limit the number of empty rides. The constraints of ...

Crew rostering is one of the most important scheduling problems that airlines have to face regularly. The goal is to assign a set of tasks to a group of workers as fairly as possible while following various business rules. Difficulties of the optimization mainly arise from its large scale. In this paper, a modified subproblem based algorithm for the LP relaxations of crew rostering problem is p...