On Manpower Scheduling Algorithms
From MaRDI portal
Publication:3941169
DOI10.1137/1024063zbMath0482.90040OpenAlexW2000345729MaRDI QIDQ3941169
James M. Tien, Angelica Kamiyama
Publication date: 1982
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1024063
Related Items
Human resources management at a marine container terminal, A mixed integer programming approach to multi-skilled workforce scheduling, Near-optimal MIP solutions for preference based self-scheduling, Workforce scheduling with multiple objectives, Efficient generation of rotating workforce schedules, Team-building with answer set programming in the Gioia-Tauro seaport, A (0-1) goal programming model for scheduling the tour of a marketing executive, On the complexity of manpower shift scheduling, Algorithms for railway crew management, A class of manpower scheduling problems, The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers, A note on a single-shift days-off scheduling problem with sequence-dependent labor costs, An efficient two-phase algorithm for cyclic days-off scheduling., A genetic algorithm approach to a nurse rerostering problem, Staff scheduling and rostering: a review of applications, methods and models., Local search for shift design., A comparison of three heuristics on a practical case of sub-daily staff scheduling, Counting and enumerating feasible rotating schedules by means of Gröbner bases, Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic, The minimum shift design problem, Towards a reference model for timetabling and rostering, Workforce planning in a lotsizing mail processing problem, Long-term staffing based on qualification profiles, A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
