In this paper we investigate the departure process for a Geo/G/1 discrete-time queueing system in which the server takes single server vacation and the system adopts Min(N, V)-policy. In this study, by employing the total probability decomposition law, renewal theory and probability generating function technique, the transient and the steady probability that the server is busy at any epoch n+ are derived. Furthermore, we also obtain the expression of the probability generating function for the expected number of departures occurring in the time interval (0+, n+] from any initial state. Meanwhile, the relationship among departure process, server busy-state process and the service renewal process in server busy period is found, which shows the especial structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by the results obtained in this paper. Finally, the asymptotic expansion for calculating expected number of departures conveniently is presented.