Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
In this paper, we propose a novel observation-based admission control algorithm, in which a client is admitted for service by a multimedia server only if the predicted extrapolati...
Harrick M. Vin, Alok Goyal, Anshuman Goyal, Pawan ...
In a supply chain, there are wide variety of problems, such as transportation scheduling problems and warehouse location problems. These problems are independently defined as opt...
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...