Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs
نویسنده
چکیده
Inspired by Mechanism Design, we study an online scheduling problem in maximizing throughput of equal length jobs with application in Auctions. We design monotone algorithms with improved competitive ratio for the problem in both models of restart and resume. Due to the monotonicity property, our algorithms deduce truthful mechanisms with the same competitive ratio in maximizing the total welfare of an auction problem with single-minded bidders.
منابع مشابه
Online Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کاملOnline Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput
We study the online problem of scheduling unit-time parallel jobs on hypercubes. A parallel job has to be scheduled between its release time and deadline on a subcube of processors. The objective is to maximize the number of early jobs. We provide a 1.6-competitive algorithm for the problem and prove that no deterministic algorithm is better than 1.4-competitive.
متن کاملDispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput
We consider online, nonpreemptive scheduling of equal-length jobs on parallel machines. Jobs have arbitrary release times and deadlines and a scheduler’s goal is to maximize the number of completed jobs (Pm | rj , pj = p | P 1− Uj). This problem has been previously studied under two distinct models. In the first, a scheduler must provide immediate notification to a released job as to whether it...
متن کاملA Note on Scheduling Equal-Length Jobs to Maximize Throughput
We study the problem of scheduling equal-length jobs with release times and deadlines, where the objective is to maximize the number of completed jobs. Preemptions are not allowed. In Graham’s notation, the problem is described as 1|rj ; pj = p| ∑ Uj. We give the following results: (1) We show that the often cited algorithm by Carlier from 1981 is not correct. (2) We give an algorithm for this ...
متن کاملApproximating the Throughput by Coolest First Scheduling
We study a temperature-aware scheduling problem aiming in maximizing the throughput of a set of unit-length jobs, each one having its own heat contribution, on a single processor operating under a strict temperature threshold. Following a simplified model for the processor’s thermal behavior, proposed by Chrobak et al. [9], we analyze the approximation factor of the natural CoolestFirst schedul...
متن کامل