A faster way to approximately schedule equally divided jobs with preemptions on a single machine by subsequent job importance growth

Abstract

The goal of this work is to study whether the input order of the job release dates results in different time of computations in finding an approximate schedule for equally divided jobs with preemptions on a single machine by subsequent job importance growth,. It has been ascertained that the descending job order has a 1 % relative advantage when scheduling more than 200 jobs. With increasing the number of jobs off 1000, the advantage tends to increase. The advantage can grow up to 22%. A maximally possible gain in computation time is obtained in scheduling longer series of bigger-sized job scheduling problems.