In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling problems in which the objective is to minimize the weighted sum of the ...

We consider an online scheduling environment where decisions are made without knowledge of the data of jobs that may arrive later. However, additional jobs can only arrive at known future times. This ...

Cloud Computing is the use of computing resources (Hardware and Software) that are delivered as a service over a network (typically the internet). It supplies a high performance computing based on ...