Polynomially solvable personnel rostering problems

Smet, Pieter; Brucker, Peter; Causmaecker, Patrick De; Berghe, Greet Vanden

doi:10.1016/j.ejor.2015.08.025

Cited by 27 publications

(25 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then ( − ℎ ) number of machines were idle, and thus it was necessary to select ( − ℎ ) number of employees from ℎ number of them to operate the remaining ( − ℎ ) number of machines. Workers were already flexible in such an environment and correspondingly FI was calculated as shown in (5).…”

Section: Measurement Of Personnel Flexibilitymentioning

confidence: 99%

“…Step 5. Implement ISAGA operation on the current optimal individual in the population, calculate the fitness value of newly generated individual, and compare the variation of fitness Δ = ( +1)− ( ) caused by two locations.…”

Section: Mutation Operatormentioning

confidence: 99%

“…Li et al [4] acquired the optimal labor allocation scheme for flexible manufacturers with the genetic algorithm and dynamic programming. Smet et al [5] solved the staffing problem where labor cost was decided by job sequence by employing the dynamic programming. Pan et al [6] proposed a two-phase heuristic algorithm for integer programming to solve the staff scheduling problem.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Impact of Personnel Flexibility on Job Shop Scheduling

Lin

Zhou

Liu

et al. 2016

Scientific Programming

View full text Add to dashboard Cite

Considering the lack of the research on the relationship between HR flexibility and scheduling effect, a resource-competency matrix-based method was proposed in order to reveal the quantitative relationship between them. Meanwhile, a job shop scheduling model with HR flexibility was established and the improved genetic algorithm was used to solve the model. A case analysis demonstrated significant impact of HR flexibility on the scheduling effect, which provided valuable guidance for building flexible manufacturing systems.

show abstract

Section: Measurement Of Personnel Flexibilitymentioning

confidence: 99%

Section: Mutation Operatormentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Impact of Personnel Flexibility on Job Shop Scheduling

Lin

Zhou

Liu

et al. 2016

Scientific Programming

View full text Add to dashboard Cite

show abstract

“…The optimisation part is a simplified version of the formulation proposed in INRC-I [12], which incorporated more real-world constraints taken from the literature. In this competition, we keep the basic and important constraints that have been mentioned in several works, including [4,7,26], to name a few. The multi-stage part is added to reflect new developments in recent literature.…”

Section: Introductionmentioning

confidence: 99%

The Second International Nurse Rostering Competition

et al. 2018

Self Cite

View full text Add to dashboard Cite

This paper reports on the Second International Nurse Rostering Competition (INRC-II). Its contributions are (1) a new problem formulation which, differently from INRC-I, is a multi-stage procedure, (2) a competition environment that, as in INRC-I, will continue to serve as a growing testbed for search approaches to the INRC-II problem, and (3) final results of the competition. We discuss also the competition environment, which is an infrastructure including problem and instance definitions, testbeds, validation/simulation tools and rules. The hardness of the competition instances has been evaluated through the behaviour of our own solvers, and confirmed by the solvers of the participants. Finally, we discuss general issues about both nurse rostering problems and optimisation competitions in general.

show abstract

“…However, most of the personnel rostering problems are hard to be solved in polynomial time, especially if they involve succession constraints such as those that limit the maximum and minimum allowed number of consecutive working days or days-off [31]. Indeed, almost all NRPs in reality imply such succession constraints.…”

mentioning

confidence: 99%

A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem

Abdelghany¹,

Eltawil²,

Yahia³

et al. 2021

JIMO

View full text Add to dashboard Cite

Nurse Rostering is the activity of assigning nurses to daily shifts in order to satisfy the cover requirements, taking into account the operational requirements and nurses' preferences. The problem is usually modeled as sets of hard and soft constraints with an objective function to minimize violations of soft constraints. The nurse rostering problem is known to be NP-hard. Many metaheuristics were used to tackle this problem. One of the frequently used heuristics is the Variable Neighbourhood Search (VNS). The VNS is usually used as a standalone method or in integration with another exact or heuristic method. In this paper, a new hybrid VNS and Dynamic Programming based heuristic approach is proposed to handle the nurse rostering problem. In the proposed approach, two perturbation mechanisms are adopted simultaneously. The proposed approach is tested on two different benchmark data sets. A comparison with state-of-the-art methods from literature revealed the competitive performance of the proposed approach.2010 Mathematics Subject Classification. Primary: 90B35; Secondary: 90C59, 90C39.

show abstract

Polynomially solvable personnel rostering problems

Cited by 27 publications

References 18 publications

Impact of Personnel Flexibility on Job Shop Scheduling

Impact of Personnel Flexibility on Job Shop Scheduling

The Second International Nurse Rostering Competition

A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem

Contact Info

Product

Resources

About