University Of Tehran Press Journal of Algorithms and Computation 2476-2776 47 1 2016 06 01 Online Scheduling of Jobs for D-benevolent instances On Identical Machines 27 36 7933 10.22059/jac.2016.7933 EN I. Mohammadi University of Tehran, Department of Algorithms and Computation. Dara Moazzami University of Tehran, College of Engineering, Faculty of Engineering Science Journal Article 2015 03 20 We consider online scheduling of jobs with specic release time on <em>m</em> 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 contribute on prot of the algorithm. In this paper we study <em>D</em>-benevolent instances which is a wide and standard class and we give a new algorithm, that admits (2<em>m</em> + 4)-competitive ratio. It is almost half of the previous known upper bound for this problem. https://jac.ut.ac.ir/article_7933_18de4beb01f6a17b6e1dfb9813ba6045.pdf