No abstract

In this paper, we consider a telecommunication service company with time-varying demand and capacity. The firm applies a uniform lead-time policy, i.e. a lead time which corresponds to the maximum time span a customer has to wait before receiving the required service is uniformly quoted to all customers. The objective is to schedule service jobs such that the shortest possible lead-time can be quoted to customers. We present an easy-to-compute approach to tackle this problem.