IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v39y2022i05ns0217595921500378.html
   My bibliography  Save this article

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

Author

Listed:
  • Wei Wu

    (Shizuoka University, 3-5-1 Nakaku-Jyohoku, Hamamatsu-shi, Shizuoka 432-8561, Japan)

  • Naoaki Katoh

    (Seikei University, 3-3-1 Kichijoji-Kitamachi, Musashino-shi, Tokyo 180-8633, Japan)

  • Atsuko Ikegami

    (Seikei University, 3-3-1 Kichijoji-Kitamachi, Musashino-shi, Tokyo 180-8633, Japan)

Abstract

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.

Suggested Citation

  • Wei Wu & Naoaki Katoh & Atsuko Ikegami, 2022. "An Iterated Local Search Heuristic for the Staff Scheduling Problem for Part-Time Employees in Japan," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 39(05), pages 1-20, October.
    • Handle: RePEc:wsi:apjorx:v:39:y:2022:i:05:n:s0217595921500378
    DOI: 10.1142/S0217595921500378
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595921500378
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595921500378?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:39:y:2022:i:05:n:s0217595921500378. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.