Fast Heuristics for a Staff Scheduling Problem with Time Interval Demand Coverage Full article
| Conference |
XXIII International Conference Mathematical Optimization Theory and Operations Research 30 Jun - 6 Jul 2024 , Омск |
||||||
|---|---|---|---|---|---|---|---|
| Source | Mathematical Optimization Theory and Operations Research : 23rd International Conference, MOTOR 2024, Omsk, Russia, June 30–July 6, 2024, Proceedings Compilation, Springer Cham. Switzerland.2024. 464 c. ISBN 978-3-031-62792-7. |
||||||
| Journal |
Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349 |
||||||
| Output data | Year: 2024, Volume: 14766, Pages: 212-228 Pages count : 17 DOI: 10.1007/978-3-031-62792-7_15 | ||||||
| Tags | staff scheduling, rostering, integer programming, local search | ||||||
| Authors |
|
||||||
| Affiliations |
|
Abstract:
Staff scheduling is a key component of supporting and increasing competitiveness for many service enterprises. This is of especially urgent concern for organizations that provide service on a twentyfour hour basis and often encounter significant fluctuations of demand. By scheduling personnel, the employers have also to strictly follow local laws, industrial regulations, and workload agreements that may considerably affect the final schedule. Staff preferences have also to be taken into account when planning work schedules, since it may reduce turnover and increase productivity. In this paper we consider a staff scheduling problem that arise in the industrial fields where the demand in staff is highly dynamic and varies within time intervals throughout a day. The goal is to assign each employee with a shift for each day of a planning horizon so as to minimize the sum of unsatisfied demand over all time intervals subject to hard workplace constraints. Note that each employee may have his/her day-specific set of pre-defined shifts and a set of work-rule constraints. We formulate the scheduling problem as a mixed-integer program. We develop several fast two-stage heuristic algorithms that includes a constructive step to find an initial solution followed by fast local search procedures. We demonstrate the effectiveness of the proposed approaches on a number of real-world huge-scale scheduling problems involving thousands of employees.
Cite:
Vasilyev I.
, Ushakov A.V.
, Arkhipov D.
, Davydov I.
, Muftahov I.
, Lavrentyeva M.
Fast Heuristics for a Staff Scheduling Problem with Time Interval Demand Coverage
In compilation Mathematical Optimization Theory and Operations Research : 23rd International Conference, MOTOR 2024, Omsk, Russia, June 30–July 6, 2024, Proceedings. – Springer Cham., 2024. – C.212-228. – ISBN 978-3-031-62792-7. DOI: 10.1007/978-3-031-62792-7_15 Scopus OpenAlex
Fast Heuristics for a Staff Scheduling Problem with Time Interval Demand Coverage
In compilation Mathematical Optimization Theory and Operations Research : 23rd International Conference, MOTOR 2024, Omsk, Russia, June 30–July 6, 2024, Proceedings. – Springer Cham., 2024. – C.212-228. – ISBN 978-3-031-62792-7. DOI: 10.1007/978-3-031-62792-7_15 Scopus OpenAlex
Dates:
| Submitted: | Apr 12, 2024 |
| Published print: | Jun 18, 2024 |
| Published online: | Jun 18, 2024 |
Identifiers:
| Scopus: | 2-s2.0-85198481703 |
| OpenAlex: | W4399742903 |
Citing:
Пока нет цитирований