This thesis introduces and investigates a new kind of scheduling model, in which the total amount of computational resources to be allocated at each moment by the processor is constrained and upper bounded by a constant. The time for a task to be executed is also dependent on the computational resources, dedicated to it by the processor, assuming that the multiplication of the execution time by the dedicated computational resources is a constant for each job. We investigate various objective functions, such as minimizing the number of tardy jobs, minimizing maximum latency and etc, under varying constraints. The investigated objective functions are: a) Minimize number of tardy jobs b)...