Generalized multifit-type methods II

We investigate a well known NP-complete problem of the scheduling theory: scheduling of identical parallel machines, that is: How to distribute n tasks among m < n machines to minimize the overall finishing time. In this article we generalize the classical algorithm Multifit: we change the bin-packing algorithm First Fit Decreasing with other bin-packing algorithms. We investigate the theoretical upper bounds of the new algorithms. Some numerical results show the efficiency of the new methods.