Login / Signup
Applying Quantum Annealing for Shift Scheduling Problem for Call Centers.
Natsuki Hamada
Kazuhiro Saito
Hideyuki Kawashima
Published in:
Int. J. Netw. Comput. (2023)
Keyphrases
</>
scheduling problem
call center
tabu search
single machine
service level
simulated annealing
flowshop
asymptotically optimal
arrival rate
setup times
np hard
minimizing makespan
parallel machines
service systems
service quality
random variables
state space
heavy traffic
probabilistic model
databases