A decomposition-based heuristic for large employee scheduling problems with inter-department transfers

DOI10.1007/S13675-019-00119-3zbMATH Open1437.90071OpenAlexW2914964871WikidataQ127367075 ScholiaQ127367075MaRDI QIDQ2175366FDOQ2175366

Dalia Attia, Guy Desaulniers, Reinhard Bürgy, François Soumis

Publication date: 29 April 2020

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-019-00119-3

zbMATH Keywords

decompositionmixed integer linear programmingshift schedulingemployees schedulingheterogeneous workforcemulti-departmentretail industry

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cites Work

• Title not available (Why is that?)
• Staff scheduling and rostering: a review of applications, methods and models.
• Personnel scheduling: a literature review
• Efficient shift scheduling in the retail sector through two-stage optimization
• Workforce planning incorporating skills: state of the art
• A large neighbourhood search approach to the multi-activity shift scheduling problem
• A two-stage solution approach for personalized multi-department multi-day shift scheduling
• Scheduling Workforce and Workflow in a High Volume Factory
• Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic

Cited In (1)

• A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing

This page was built for publication: A decomposition-based heuristic for large employee scheduling problems with inter-department transfers

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