Scheduling algorithms for makespan uniform parallel machine with release dates

The problem of uniform parallel machine scheduling with unequal release dates was considered so as to minimize makespan. Five heuristic algorithms were proposed by the way of extending the research results of the corresponding problems in the single machine or identical parallel machine cases. An example and the compute results were given and the performance of the algorithms by experiment was analyzed. Comparison was made between the heuristics and existing Koulamas and Kyparisis's algorithm.