相关期刊:《International Journal of Transportation Science and Technology》《Journal of Computer and Communications》《Computers, Materials & Continua》《Building Simulation》更多>>
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...
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...
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...