A generalization of the D-[X]/D/1 queue is investigated, where indepen
dent and identically distributed (i.i.d) batches of customers arrive a
t a single-server queue periodically. The service requirement of a cus
tomer is a fixed constant equal for all the customers. In the time bet
ween two successive arrivals, the server can accommodate exactly K gre
ater than or equal to 1 customers. The queue size and the waiting time
distributions for the infinite buffer queue are derived. Important nu
merical aspects are addressed and simple approximations for light and
heavy traffic for various values of K and Poisson distributed batches
are proposed. Finally, the analysis for the finite queue is highlighte
d and its blocking probability derived.