Minimizing maximum tardiness for unrelated parallel machines

In this paper, the scheduling of n jobs, all requiring a single stage of processing, on m unrelated parallel machines is considered. The scheduling objective is to minimize the maximum tardiness. An algorithm is proposed for the above problem. Computational results are reported with data generated using various combinations of processing times and due dates. The results show that the proposed algorithm meets the expectations of any scheduling environment.