Pα_2/β′/C_(max) PROBLEM WITH GENERAL PURPOSE PROCESSOR IN VARIOUS TYPES OF TASKS SCHEDULING

The Multifit Algorithm for P∥C max problem is improved in the case nonpreemptively scheduling k types of tasks on ( k +1) types of identical, parallel processors (one is general purpose processor). The feasibility of the new algorithm and the worst case performance ratio are analyzed. And it is proved that for k =2 the bound is in [5/4,4/3].