A Staff Scheduling Problem of Customers with Reservations in Consideration with Expected Wait Time of a Customer without Reservation

Junji Koyanagi ()
Additional contact information
Junji Koyanagi: Graduate School of Tottori University

A chapter in Applications in Reliability and Statistical Computing, 2023, pp 219-226 from Springer

Abstract: Abstract In cell phone stores in Japan, they serve customers with reservations and ones without reservations. The manager of the shop assigns a staff to each customer with reservations (CR) at the start of or before the day. For the customers without reservations (CN), they are served by the staff who does not serve other customers. However, no staff is available to serve CN, CN must wait until some staff can serve CN. The assignment of CR to the staff should be scheduled not to wait CR. The wait time of CN should be as short as possible, though they are served not to delay the service of CR. The minimization of the expected wait time of the first CN is considered in this research. Taboo search method is adopted for the optimization of the evaluation function to assign each reservation to each staff and to minimize the waiting time of the first CN.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:ssrchp:978-3-031-21232-1_11

Ordering information: This item can be ordered from
http://www.springer.com/9783031212321

DOI: 10.1007/978-3-031-21232-1_11

Access Statistics for this chapter

More chapters in Springer Series in Reliability Engineering from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().