Summary: This paper studies an M/M/1/\(N\) multiple working vacation queuing system with limited capacity, in which customers are either “positive” or “negative”, introduces impatient strategy, exhaustive service, feedback and set-up time, simultaneously assumes that desk may malfunction. The matrix form solution of steady-state probability is derived by the Markov process method, and the steadystate probability in matrix form is derived by using matrix-geometric solution and block-matrix-solution method. Some reliable indices of the steady-state system are given. Finally, the corresponding numerical analysis is made by Matlab, which would provide a basis for optimal design.