Polynomially solvable personnel rostering problems-Reference-Cited by-同舟云学术

Polynomially solvable personnel rostering problems

Published:2016-02 Issue:1 Volume:249 Page:67-75
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

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

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference20 articles.

1. Network flows: Theory, algorithms, and applications;Ahuja,1993

2. Preference scheduling for nurses using column generation;Bard;European Journal of Operational Research,2005

3. Integer programming to schedule a hierarchical workforce with variable demands;Billionnet;European Journal of Operational Research,1999

4. A shift sequence based approach for nurse scheduling and a new benchmark dataset;Brucker;Journal of Heuristics,2010

5. Personnel scheduling: Models and complexity;Brucker;European Journal of Operational Research,2011

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast Heuristics for a Staff Scheduling Problem with Time Interval Demand Coverage;Lecture Notes in Computer Science;2024

2. Operational Research: methods and applications;Journal of the Operational Research Society;2023-12-27

3. Hybrid Optimization for Nurse Rostering Problem : Integrating Greedy Solution and Local Genetic Algorithm with Dynamic Encoding;2023 9th International Conference on Big Data and Information Analytics (BigDIA);2023-12-15

4. Optimizing Nurse Scheduling in Organizations a Heuristic Algorithm Assisted by Adaptive Integer Programming Reconstruction;2023 IEEE 3rd International Conference on Digital Twins and Parallel Intelligence (DTPI);2023-11-07

5. On the complexity of Nurse Rostering problems;Operations Research Letters;2023-09