A General Branch-and-Cut Framework for Rotating Workforce Scheduling

DOI10.1287/ijoc.2021.1149OpenAlexW4210930293MaRDI QIDQ5087722

Maximilian Schiffer, Grit Walther, Tristan Becker

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

zbMATH Keywords

integer programmingschedulinghuman resource planning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Uses Software

• MiniZinc

Cites Work

• A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
• Duty-period-based network model for crew rescheduling in European airlines
• Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
• Rotating schedules
• Cyclic and non-cyclic scheduling of 12h shift nurses by network programming
• Greedy randomized search for scalable compilation of quantum circuits
• On the exact solution of the no-wait flow shop problem with due date constraints
• An annotated bibliography of personnel scheduling and rostering
• An exact algorithm for the simplified multiple depot crew scheduling problem
• A flexible, fast, and optimal modeling approach applied to crew rostering at London Underground
• The fleet assignment problem: Solving a large scale integer program
• On the complexity of manpower shift scheduling
• Staff optimization for time-dependent acute patient flow
• Instance space analysis for a personnel scheduling problem
• Personnel scheduling: a literature review
• Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements
• Multiple-Shift Workforce Scheduling Under the 3–4 Workweek with Different Weekday and Weekend Labor Requirements
• The Continuous-Time Service Network Design Problem
• A general multi-shift scheduling system

This page was built for publication: A General Branch-and-Cut Framework for Rotating Workforce Scheduling