Shu-chu Zhang

  • Citations Per Year
Learn More
This paper considers the problem of uniform parallel machine scheduling with unequal release dates so as to minimize makespan. This problem is proved to an NP-hard problem. Heuristics in existence for the problem are analyzed, and then we present an improved algorithm. The performance of the algorithms by experiment is also analyzed. The heuristic is(More)
This paper considers the multi-processor scheduling problem with unequal release dates to minimize total completion times. This problem is proved to be NP-hard in the strong sense. Traditional forward algorithms base on the heuristic rule SPT (shortest processing time first) and ERD (earliest release date first) for the problem are analyzed. A backward(More)
  • 1