Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Hongxi Teng"'
Autor:
Yabo Luo, Hongxi Teng
Publikováno v:
2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE).
Job shop Scheduling Problem is an NP-hard combinatorial optimization problem. The research on its solving algorithm has been a hot topic, and many achievements have been made. However, due to the complexity of time and variable space in the solving p
Autor:
Yabo Luo, Hongxi Teng
Publikováno v:
2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE).
As the half-life period of knowledge is getting shorter and shorter, the mutual transformation between scientific research results and teaching content is an effective means to keep students updated with knowledge. Based on the principle of knowledge