A Staff Scheduling Problem of Customers with Reservations in consideration with Customers without Reservations  
Author Yuta Harada


Co-Author(s) Junji Koyanagi


Abstract There are several service businesses such as a cell phone store which serves customers with reservations and ones without reservations. For the customers with reservations (CR), the manager assigns a staff to each CR on the day. There are the customers that come to the shop without reservations. These customers are served by the staff who does not serve CR. However, when all staff are occupied by CR, the new customer must wait. The assignment of the reservations to the staff is made not to wait CR before the day. However, customers without reservations may wait in a long time, because they are served not to delay the customers’ service with reservations. Since the waiting time should be as short as possible, this paper deals with the minimization of the expected waiting time of the first customer without reservation. Taboo search method is adopted for the optimization of the evaluation function to ensure and to assign each reservation to each staff without conflict.


Keywords Taboo Search , Staff Scheduling, Expected Waiting Time, Reservation
    Article #:  RQD26-102

Proceedings of 26th ISSAT International Conference on Reliability & Quality in Design
Virtual Event

August 5-7, 2021