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

DOI10.1287/IJOC.2021.1149MaRDI QIDQ5087722zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

integer programmingschedulinghuman resource planning

Mathematics Subject Classification ID

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

Recommendations

• Solver independent rotating workforce scheduling
• Efficient generation of rotating workforce schedules
• Rota: A research project on algorithms for workforce scheduling and shift design optimization
• Solving the general employee scheduling problem
• A general multi-shift scheduling system

Cites work

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

Cited in

(4)

• The art and science of designing rotating schedules
• Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation
• A methodology to create robust job rotation schedules
• scientific article; zbMATH DE number 1462943 (Why is no real title available?)

Describes a project that uses

Uses Software

• MiniZinc

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)