Heuristics for Large Scale Labour Scheduling Problems in Retail Sector

DOI10.3138/INFOR.45.3.111MaRDI QIDQ6102817zbMATH OpenOpenAlexFDO

Authors

Publication date 9 May 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3138/infor.45.3.111

zbMATH Keywords

heuristicsinteger programmingretail labour schedulingshift generation

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Scheduling part-time personnel with availability restrictions and preferences to maximize employee satisfaction
• A large neighbourhood search approach to the multi-activity shift scheduling problem
• Compressed workweek scheduling with differing weekdays and weekends labor demands
• Heuristics for flexible employee scheduling

Cites work

• A Queuing-Linear Programming Approach to Scheduling Police Patrol Cars
• Accounting for time-varying queueing effects in workforce scheduling
• An annotated bibliography of personnel scheduling and rostering
• Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands
• Staff scheduling and rostering: a review of applications, methods and models.
• Survey, categorization, and comparison of recent tour scheduling literature
• Using Benders decomposition to implicitly model tour scheduling

Cited in

(1)

• An integer linear programming-based heuristic for scheduling heterogeneous, part-time service employees

This page was built for publication: Heuristics for Large Scale Labour Scheduling Problems in Retail Sector

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