Tercih edilen hizmet başlangıç zamanlı ve çoklu müşteri sınıflı kuyruk sistemleri

Motivated by the operational problems in curbside pickup systems, in this thesis, a capacity allocation problem in a queuing system, where arriving customers have preferred service delivery times, is studied. In the illustrated system, customers may have different priorities. All requests are assumed to be served before or during their requested time period. In order to increase the generality of the model, actions of early service, rejecting a customer request, and outsourcing (or equivalently working overtime) are allowed for the service provider. We model this problem as a Markov Decision Process. We analyze the structural properties to identify a set of suboptimal solutions and use these results to develop efficient solution methods. We develop state space aggregation methods to solve problem instances of larger size.