Fast heuristics for a staff scheduling problem with time interval demand coverage

DOI10.1007/978-3-031-62792-7_15MaRDI QIDQ7021047zbMATH OpenFDO

Authors Igor' Leonidovich Vasilyev, Anton Vladimirovich Ushakov, Dmitry I. Arkhipov, I. Davydov, Ildar Muftahov, Maria Lavrentyeva

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-62792-7_15

zbMATH Keywords

integer programminglocal searchrosteringstaff scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A graph-based formulation for the shift rostering problem
• A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem
• A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements
• Algorithms for large scale shift minimisation personnel task scheduling problems
• Mathematical models and solution approach for cross-training staff scheduling at call centers
• Modelling and evaluation issues in nurse rostering
• Optimization by GRASP. Greedy randomized adaptive search procedures
• Personnel scheduling: a literature review
• Personnel scheduling: models and complexity
• Polynomially solvable personnel rostering problems
• Solving the general employee scheduling problem
• Staff scheduling and rostering: a review of applications, methods and models.
• Staff scheduling at the United States postal Service
• State of the art in Physician scheduling

This page was built for publication: Fast heuristics for a staff scheduling problem with time interval demand coverage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021047)