An Iterated Local Search Heuristic for the Staff Scheduling Problem for Part-Time Employees in Japan

In this paper, we introduce a mathematical programming model for solving a staff scheduling problem based on one-day duties (task patterns) of individual staff members. The model can accommodate various service types, management policies, and staff preferences. We first enumerate all feasible one-da...

Full description

Saved in:
Bibliographic Details
Published in:Asia-Pacific journal of operational research 2022-10, Vol.39 (5)
Main Authors: Wu, Wei, Katoh, Naoaki, Ikegami, Atsuko
Format: Article
Language:English
Subjects:
Algorithms
Dynamic programming
Mathematical programming
Operations research
Part time employment
Scheduling
Searching
Task scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we introduce a mathematical programming model for solving a staff scheduling problem based on one-day duties (task patterns) of individual staff members. The model can accommodate various service types, management policies, and staff preferences. We first enumerate all feasible one-day duties and propose an iterated local search approach that incorporates various methodologies, including a size-reduction method and a very large-scale neighborhood search. For the very large-scale neighborhood search, we design a dynamic programming method that aims to find the most improved schedule and can be used in the rescheduling stage. Computational results show that the model and the proposed algorithm perform well for real-world instances in Japan.
ISSN:0217-5959
1793-7019
0217-5959
DOI:10.1142/S0217595921500378