We introduce the concert queueing game: Fixed but large number of customers arrive into a queue that starts serving at a specified time. 
Customers have cost functions which depend on their waiting time and the number of customers who are served before them. Customers can arrive before the service starts. We develop a queueing game framework to address such problems. We analyze the system in the asymptotic regime and develop a fluid limit for the resultant queueing system. In the fluid model, we identify the unique Nash equilibrium profile for each class of customers. When there is a single class of customers, we show that the price of anarchy of the queueing game is  two. We show that the price of anarchy can be reduced by introducing a pricing mechanism, and can be made to approach one.