Abstract: Data scheduling in peertopeer content distribution system considers how peers select partners for interesting data. A novel optimal content distribution data scheduling algorithm based on the parallel machine scheduling model was designed to assign the chunk requests among the known neighbor peers in a balanced way. The simulation results show that the proposed algorithm can further improve the system throughput and mitigate the load of original content server with typical chunk selection methods comparing with the data scheduling scheme selecting neighbor peers randomly.