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

zbMATH Keywords

local searchinteger programmingrosteringstaff scheduling

Mathematics Subject Classification ID

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

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)