İşletmelerde en büyük maliyet kalemleri arasında olan işgücü maliyetini etkili bir şekilde yönetebilmek ve bu maliyetleri azaltabilmek için yapılan planlamaların, programların etkisi çok önemlidir. Literatürde personel çizelgeleme olarak adlandırılan problemlerde kaynağını planlayarak hem dengeli adil çalışma ortamı ayarlanmış olur de maliyetlerini dolaylı azaltılmasına katkıda bulunulur. Perso...

In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...

The efficient management of nursing personnel is of critical importance in a hospital’s environment comprising a vast share of the hospital’s operational costs. The nurse scheduling process affects highly the nurses’ working conditions, which are strongly related to the provided quality of care. In this paper, we consider the rostering over a mid-term period that involves the construction of du...

Labor costs are amongst the most important costs for companies in highly developed countries. While manufacturers move their production units en masse to low wage countries, service companies are often tied to their current locations. Unlike production, the service surplus value is often directly related to the place where the service is provided. Moreover, service companies generally require m...

Global constraints are useful for modelling and reasoning about real-world combinatorial problems. Unfortunately, developing propagation algorithms to reason about global constraints efficiently and effectively is usually a difficult and complex process. In this paper, we show that reformulation may be helpful in building such propagators. We consider both hard and soft forms of two powerful gl...

Nurse Rostering Problems (NRPs) consist of generating rosters where required shifts are assigned to nurses over a scheduling period satisfying a number of constraints. In [25], we have shown how soft global constraints can be used to model NRPs in a concise and elegant way. In this paper we go one step further by proposing new neighborhood heuristics for VNS/LDS+CP. Experiments show that, despi...

In this paper, we present a hybrid genetic algorithm for the well-known nurse scheduling problem (NSP). The NSP involves the construction of roster schedules for nursing staff in order to maximize the quality of the roster schedule and to minimize the violations of the minimal coverage requirements subject to various hard case-specific constraints. In literature, several genetic algorithms have...

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 of the network at varying time periods subject to rostering as well as security-related constraints. We present several mathematical programming models for different Variants of this proble...

The main challenge of Nurse Scheduling Problem (NSP)is designing a nurse schedule that satisfies nurses preferences at minimal cost violating the soft constraints. This makes NSP an NP-hard problem with no perfect solution yet. In this study, two meta-heuristics procedures: Genetic Algorithm (GA) and Tabu Search (TS) memory was applied for development automatic hospital scheduling system (GATS_...

We present a multi-objective approach to tackle a real-world nurse scheduling problem using an evolutionary algorithm. The aim is to generate a few good quality non-dominated schedules so that the decision-maker can select the most appropriate one. Our approach is designed around the premise of ‘satisfying individual nurse preferences’ which is of practical significance in our problem. We use f...