<p>We introduce and study a queue with the Erlang service system and whose arrivals are governed by a counting process in which there is a possibility of more than one arrival at any instant. We call it the Erlang queue with multiple arrivals. We derive a system of differential equations for its transient probabilities. Its probability generating function is obtained from which the explicit expressions of its transient probabilities are derived. Also, the probability of zero customers at any instant is obtained. Further, we define the queue length process for Erlang queue with multiple arrivals and obtain a system of differential equations for its mean queue length. We derive the explicit expression for the mean queue length and the second moment of the queue length process. Also, we study a time-changed variant of it by subordinating it with an independent inverse stable subordinator for which we obtain its state probabilities, mean queue length and distribution of busy period.</p>