List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708): Difference between revisions

The problem of minimizing the makespan on parallel identical machines is considered. A popular technique for this problem is list scheduling, according to which the jobs are scanned in a certain order (the list) and the next job is assigned to the first available machine. Heuristic algorithms designed in this paper are of list scheduling type, however the rule for forming the list does not, stay unchanged but can be altered after having scheduled a certain number of jobs. Computational experiments reported in the paper demonstrate good performance of the algorithms of this nature.