Abstract
This study focuses on the maximization of the minimum completion time using identical parallel processors. The objective of this maximization is to ensure fair distribution. A set of processes is to be scheduled to several identical parallel processors, and this problem is proved as NP-hard. The research for this paper is based primarily on the performance of the proposed heuristics with other methods cited in the literature review. Our heuristics are developed mainly using the randomization method and the iterative utilization of the knapsack problem to solve the above-mentioned problem. The heuristics are assessed by several instances represented in the experimental results. The results shew that the knapsack-based heuristic provides a performance that is almost like the heuristic in the literature review but with better running time.