SU Chun-jie. The Complexity of the Parallel Machine Scheduling about Tardiness[J]. Journal of East China University of Science and Technology, 2002, (6): 657-660664.
Citation:
SU Chun-jie. The Complexity of the Parallel Machine Scheduling about Tardiness[J]. Journal of East China University of Science and Technology, 2002, (6): 657-660664.
SU Chun-jie. The Complexity of the Parallel Machine Scheduling about Tardiness[J]. Journal of East China University of Science and Technology, 2002, (6): 657-660664.
Citation:
SU Chun-jie. The Complexity of the Parallel Machine Scheduling about Tardiness[J]. Journal of East China University of Science and Technology, 2002, (6): 657-660664.
The Complexity of the Parallel Machine Scheduling about Tardiness
In this paper, the complexity of the parallel machine scheduling with two servers was studied. It is proved that the P3,S2/s_i=1/L_ max problem is strong NP-hard. Then it is also proved that the other two problems P3,S2/p_i=1/L_ max and P3,S2/s_i=1,d_i=d/L_ max are NP-hard.
DownLoad: