相关期刊:《International Journal of Transportation Science and Technology》《Journal of Computer and Communications》《Computers, Materials & Continua》《Building Simulation》更多>>
This research work was supported by the University Malaysia Sabah,Malaysia.
University timetabling problems are a yearly challenging task and are faced repeatedly each semester.The problems are considered nonpolynomial time(NP)and combinatorial optimization problems(COP),which means that they...
This work was supported in part by the Outstanding Young Scholar Program of National Natural Science Foundation of China(NSFC)(Grant No.61522311);in part by the General Program of NSFC(Grant No.61773300);in part by the Key Program of Fundamental Research Project of Natural Science of Shaanxi Province,China(2017JZ017);in part by the Doctoral Students'Short-Term Study Abroad Scholarship Fund of Xidian University.
As the first attempt,this paper proposes a model for the Chinese high school timetabling problems(CHSTPs)under the new curriculum innovation which was launched in 2011 by the Chine6e government.Aooording 10 the new ou...
This work was supported by the National Natural Science Foundation of China (Nos. G61374065, G61034007, G61374002); the Fund for the Taishan Scholar Project of Shandong Province, the Natural Science Foundation of Shandong Province (No. ZR2010FM013); the Scientific Research and Development Project of Shandong Provincial Education Department (No. J11LA01 )
This paper investigates the robust graph coloring problem with application to a kind of examination timetabling by using the matrix semi-tensor product, and presents a number of new results and algorithms. First, usin...