On the complexity of manpower shift scheduling
From MaRDI portal
Publication:1906950
DOI10.1016/0305-0548(94)00094-OzbMath0838.90065OpenAlexW4243899040MaRDI QIDQ1906950
Publication date: 30 May 1996
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)00094-o
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)
Related Items (23)
Near-optimal MIP solutions for preference based self-scheduling ⋮ Efficient generation of rotating workforce schedules ⋮ Team-building with answer set programming in the Gioia-Tauro seaport ⋮ Polynomially solvable personnel rostering problems ⋮ A hybrid integer and constraint programming approach to solve nurse rostering problems ⋮ The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers ⋮ A General Branch-and-Cut Framework for Rotating Workforce Scheduling ⋮ Cyclic preference scheduling of nurses using a Lagrangian-based heuristic ⋮ An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment ⋮ A note on a single-shift days-off scheduling problem with sequence-dependent labor costs ⋮ Short-term manpower planning for MRT carriage maintenance under mixed deterministic and stochastic demands ⋮ An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria ⋮ Local search for shift design. ⋮ Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model ⋮ Modeling and solving staff scheduling with partial weighted maxSAT ⋮ Counting and enumerating feasible rotating schedules by means of Gröbner bases ⋮ The minimum shift design problem ⋮ A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems ⋮ Personnel scheduling: models and complexity ⋮ Instance space analysis for a personnel scheduling problem ⋮ A graph-based formulation for the shift rostering problem ⋮ A flexible MILP model for multiple-shift workforce planning under annualized hours ⋮ A classification scheme for integrated staff rostering and scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multi-level bottleneck assignment approach to the bus drivers' rostering problem
- A heuristic approach to the bus driver scheduling problem
- Multiple Shift Workforce Lower Bounds
- On Manpower Scheduling Algorithms
- On the Complexity of Timetable and Multicommodity Flow Problems
- Workforce Scheduling with Cyclic Demands and Day-Off Constraints
- A Modular Approach to Optimal Multiple-Shift Manpower Scheduling
This page was built for publication: On the complexity of manpower shift scheduling
