We study models of quantum queues based on discrete time quantum walks with barriers. Our considerations refer to multi-servers queuing models. Input and output of jobs in the queue are realized by systems consisting of quantum coins and walkers. We show that presented models behave differently from the classical ones. We also present numerical methods for optimisation of jobs processed by the system. We simultaneously maximise jobs throughput in the system and minimise the number of jobs lost.