SOBRE ESCALONAMENTO EM M ´ AQUINAS PARALELAS COM CAPACIDADES DISTINTAS

This paper tackles problems of scheduling tasks on uniform parallel machines. In this case, the scheduling can be done in a set of machines in parallel, where they have distinct characteristics expressed in terms of different speeds of execution. Algorithms are presented for problems Qjpj = 1j P wjUj and Qjpj = pj P wjUj, with n independent jobs and m parallel uniform machines. The problems involving tasks with equal processing times (unit time or not), and different priorities. The objective is to determine optimal scheduling with a minimum number of weighted tardy jobs. The best current solution to these problems, involves their modeling as an assignment problem, resulting in an algorithm of complexity O(n 3 ). Our proposed algorithm solve these problems in