On Manpower Scheduling Algorithms
From MaRDI portal
Cited in
(24)- Long-term staffing based on qualification profiles
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Efficient generation of rotating workforce schedules
- Algorithms for railway crew management
- An efficient two-phase algorithm for cyclic days-off scheduling.
- Staff scheduling and rostering: a review of applications, methods and models.
- Local search for shift design.
- Towards a reference model for timetabling and rostering
- Workforce planning in a lotsizing mail processing problem
- Human resources management at a marine container terminal
- On the complexity of manpower shift scheduling
- The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers
- Counting and enumerating feasible rotating schedules by means of Gröbner bases
- Workforce scheduling with multiple objectives
- A genetic algorithm approach to a nurse rerostering problem
- The minimum shift design problem
- A mixed integer programming approach to multi-skilled workforce scheduling
- Near-optimal MIP solutions for preference based self-scheduling
- Team-building with answer set programming in the Gioia-Tauro seaport
- A class of manpower scheduling problems
- A comparison of three heuristics on a practical case of sub-daily staff scheduling
- A note on a single-shift days-off scheduling problem with sequence-dependent labor costs
- A (0-1) goal programming model for scheduling the tour of a marketing executive
- Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic
This page was built for publication: On Manpower Scheduling Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3941169)