On the complexity of manpower shift scheduling
DOI10.1016/0305-0548(94)00094-OzbMATH Open0838.90065OpenAlexW4243899040MaRDI QIDQ1906950FDOQ1906950
Authors: Hoong Chuin Lau 
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
Recommendations
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
- Title not available (Why is that?)
- A multi-level bottleneck assignment approach to the bus drivers' rostering problem
- On the Complexity of Timetable and Multicommodity Flow Problems
- On Manpower Scheduling Algorithms
- A heuristic approach to the bus driver scheduling problem
- A Modular Approach to Optimal Multiple-Shift Manpower Scheduling
- Multiple Shift Workforce Lower Bounds
- Workforce Scheduling with Cyclic Demands and Day-Off Constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (29)
- On the complexity of nurse rostering problems
- Title not available (Why is that?)
- Complexity results for the basic residency scheduling problem
- On the computational complexity of (maximum) shift class scheduling
- Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model
- Complexity of workforce scheduling in transfer lines
- A note on a single-shift days-off scheduling problem with sequence-dependent labor costs
- An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment
- Near-optimal MIP solutions for preference based self-scheduling
- Short-term manpower planning for MRT carriage maintenance under mixed deterministic and stochastic demands
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- A classification scheme for integrated staff rostering and scheduling problems
- Efficient generation of rotating workforce schedules
- 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
- Team-building with answer set programming in the Gioia-Tauro seaport
- A flexible MILP model for multiple-shift workforce planning under annualized hours
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- Polynomially solvable personnel rostering problems
- Instance space analysis for a personnel scheduling problem
- Personnel scheduling: models and complexity
- The minimum shift design problem
- Modeling and solving staff scheduling with partial weighted maxSAT
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
- Local search for shift design.
- A hybrid integer and constraint programming approach to solve nurse rostering problems
- A General Branch-and-Cut Framework for Rotating Workforce Scheduling
- A graph-based formulation for the shift rostering problem
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
This page was built for publication: On the complexity of manpower shift scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906950)
