In this paper, we provide all information to participate to the Second International Nurse Rostering Competition (INRC-II). First, we describe the problem formulation, which, differently from INRC-I, is a multi-stage procedure. Second, we illustrate all the necessary infrastructure do be used together with the participant’s solver, including the testbed, the file formats, and the validation/sim...

A nurse rostering problem is an NP-Hard that difficult to solve during the complexity of problem. Since good scheduling schedule fulfilled hard constraint and minimizes violation soft constraint, a lot approaches implemented improve quality schedule. This research proposed improvement on ant colony optimization with semi-random initialization for problems. Semi-random applied avoid then will be...

Assigning nursing staff to specific duties according to their contract, qualifications, skills, etc. within a working environment characterised by multi-disciplinarity and statutory regulations is problematic. Factors involved in making effective assignments include individual and corporate procedures, guidelines and constraints. Manual rostering commonly proceeds through a process of reasoning...

Despite the multi-objective nature of nurse rostering problem (NRP), most NRP formulations employ a single evaluation function that minimizes weighted sum constraint violations. When solving in practice, focus should be on obtaining compromise solutions: those with appropriate trade-offs between different constraints. Due to real-world characteristics problem, may vary substantially across inst...

Researchers have studied the nurse rostering problem for multiple decades. Initially, formulations were rather primitive including only a few necessary restrictions, but down road, become more complex. Nonetheless, fraction of research reaches implementation in practice, and many wards still schedule nurses manually. In this article, we introduce flexible system that employs mathematical optimi...

A practical nurse rostering problem, which arises at a ward of an Italian hospital, is considered. The nurse rostering problem is a typical employee timetabling problem, where each month it is required to generate the nursing staff shifts subject to various contractual and operational requirements. These requirements may be in conflict especially for those months in which manpower is reduced du...

In this paper, we investigate the hybridization of constraint programming and local search techniques within a large neighbourhood search scheme for solving highly constrained nurse rostering problems. As identified by the research, a crucial part of the large neighbourhood search is the selection of the fragment (neighbourhood, i.e. the set of variables), to be relaxed and re-optimized iterati...

Harmony Search Algorithm (HSA) is a relatively new nature-inspired algorithm. It evolves solutions in the problem search space by mimicking the musical improvisation process in seeking agreeable harmony measured by aesthetic standards. The Nurse Rostering Problem (NRP) is a well-known NP-hard scheduling problem that aims at allocating the required workload to the available staff nurses at healt...