An adaptive packet scheduling method is presented in this paper. The adaptive weights of a scheduler are chosen based on maximizing the revenue of the network service provider. The pricing scenario is based on the delay that a connection will inflict to other connections. The features of the adaptive weight updating algorithm are simulated, analyzed and compared to a constant weight algorithm.