A General Branch-and-Cut Framework for Rotating Workforce Scheduling
From MaRDI portal
Publication:5087722
DOI10.1287/IJOC.2021.1149OpenAlexW4210930293MaRDI QIDQ5087722FDOQ5087722
Authors: Tristan Becker, Maximilian Schiffer, Grit Walther
Publication date: 1 July 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1149
Recommendations
Cites Work
- The fleet assignment problem: Solving a large scale integer program
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- Cyclic and non-cyclic scheduling of 12h shift nurses by network programming
- An annotated bibliography of personnel scheduling and rostering
- On the complexity of manpower shift scheduling
- Personnel scheduling: a literature review
- Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements
- Duty-period-based network model for crew rescheduling in European airlines
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
- A general multi-shift scheduling system
- The Continuous-Time Service Network Design Problem
- An exact algorithm for the simplified multiple depot crew scheduling problem
- Multiple-Shift Workforce Scheduling Under the 3–4 Workweek with Different Weekday and Weekend Labor Requirements
- Rotating schedules
- Greedy randomized search for scalable compilation of quantum circuits
- A flexible, fast, and optimal modeling approach applied to crew rostering at London Underground
- On the exact solution of the no-wait flow shop problem with due date constraints
- Staff optimization for time-dependent acute patient flow
- Instance space analysis for a personnel scheduling problem
Cited In (4)
Uses Software
This page was built for publication: A General Branch-and-Cut Framework for Rotating Workforce Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087722)