Resource allocation scheduling with deteriorating jobs and position-dependent workloads

Abstract

<p style='text-indent:20px;'>In this study, we consider the resource allocation scheduling with a deterioration effect and position-dependent workloads concurrently on a single machine. The scheduler needs to find the optimal sequence and the optimal resource allocation such that a cost function is minimized. First, the focus is on minimizing the linear weighted sum of the schedule cost and resource consumption cost. Second problem is to minimize the schedule cost subject to an upper bound on the resource consumption cost. Third problem is to minimize the resource consumption cost subject to an upper bound on the schedule cost. Last problem is to find Pareto-optimal solutions for schedule cost and resource consumption cost. We proved that these problems remain polynomially solvable respectively.</p>

Research on collaborative and integrated resource schedulingalgorithm in heterogeneous cloud environment

“…For scheduling algorithms of heterogeneous cloud resources, single metrics are commonly used, such as scheduling execution time, scheduling coverage, scheduling deadline, etc. The heterogeneous cloud environment is not only large in size but also complex in composition, so only a single scheduling metric cannot fully meet the scheduling requirements of heterogeneous cloud resources [11]. For a single scheduling task, the heterogeneous cloud platform usually adopts a node to process it, which not only saves the task completion time but also improves the resource utilization of the heterogeneous cloud platform equipment.…”

Transitive Reduction Approach to Large-Scale Parallel Machine Rescheduling Problem With Controllable Processing Times, Precedence Constraints and Random Machine Breakdown

“…Despite some special form [1] and the discrete ones [2], [3], [4], the resource consumption function describes the relationship between processing time and resource linearly and nonlinearly respectively as cpt ∈ cpt lin , cpt conv [5], [6], [7], [8], [9], [10], [11]. In the linear case, processing time is linearly decreasing with respect to the amount of resource allocated into it as p job i u job i = p job i − α job i u job i , 0 ≤ p job i ≤ p job i u job i ≤ p job i , i = 1, 2, .…”