On the hardness of palletizing bins using FIFO queues.

Frank Gurski Carolin Rehs Jochen Rethmann

Published in: Theor. Comput. Sci. (2019)

Keyphrases

heavy traffic
service rates
queueing networks
waiting times
processor sharing
single server
queue length

finite capacity
phase transition
retrial queue
np complete
information theoretic
queuing systems
agnostic learning

np hard
computational complexity
data flow
learning theory
steady state
high speed
priority queue

information systems
conservation laws
data sets
data transfer
information retrieval
neural network