相关期刊:《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...
supported by Deanship of Scientific Research at Imam Abdulrahman Bin Faisal University,under the Project Number 2019-383-ASCS.
Timetabling problem is among the most difficult operational tasks and is an important step in raising industrial productivity,capability,and capacity.Such tasks are usually tackled using metaheuristics techniques that...
A real-life problem is the rostering of nurses at hospitals.It is a famous nondeterministic,polynomial time(NP)-hard combinatorial optimization problem.Handling the real-world nurse rostering problem(NRP)constraints i...
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...
National Natural Science Foundations of China(Nos.61174040,61573144,11304200);Shanghai Commission of Science and Technology,China(No.12JC1403400);Shanghai Municipal Education Commission for Training Young Teachers,China(No.ZZSDJ15031);Shanghai Teaching and Reforming Experimental Undergraduate Majors Construction Program,China
Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop sch...
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...
National Natural Science Foundations of China(Nos.61174040,61104178);Shanghai Commission of Science and Technology,China(No.12JC1403400);the Fundamental Research Funds for the Central Universities,China
The strong non-deterministic polynomial-hard( NP-hard)character of job shop scheduling problem( JSSP) has been acknowledged widely and it becomes stronger when attaches the nowait constraint,which widely exists in man...