期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Exploration of teaching English to Korean-Chinese bilinguals
1
作者 NAN Cheng-yu 《Sino-US English Teaching》 2009年第11期23-25,共3页
Since Korean ethnics in China learn English on the basis of two languages and two cultures, there is dual transfer of Korean-Chinese when they learn English. They can make good use of two language systems and dual pos... Since Korean ethnics in China learn English on the basis of two languages and two cultures, there is dual transfer of Korean-Chinese when they learn English. They can make good use of two language systems and dual positive transfer, and make English-Korean and English-Chinese comparative analysis in the basic stages of English learning. 展开更多
关键词 Korean-Chinese bilinguals TRANSFER dual positive transfer English learning
下载PDF
The Study of Group Scheduling Problems with General Dual-Position-Based Job Processing Times
2
作者 Xian-Yu Yu De-Qun Zhou Yu-Lin Zhang 《Journal of the Operations Research Society of China》 EI CSCD 2017年第4期509-527,共19页
Scheduling with group technology has been a vivid research area in the past decades.However,group technology with general dual-effect variable processing times needs to be further explored although this kind of group... Scheduling with group technology has been a vivid research area in the past decades.However,group technology with general dual-effect variable processing times needs to be further explored although this kind of group technology plays an important role in some actual manufacturing scenarios.Accordingly,this paper considers group scheduling problems with a kind of general group variable processing times model,where the actual processing time of each job in group is variable due to the dual effect of both the job position and the group position.The objectives of two types of considered problems are to minimize the makespan and the total completion time,respectively.Based on the decomposition analysis,the mathematical logic analysis and the computational complexity proof,it is obtained that the makespan minimization problem and the total completion time minimization problem are both polynomially solvable under the condition that the group number is constant.For three special cases of considered problems,polynomial solving algorithms with lower computational complexity are proposed. 展开更多
关键词 Group scheduling Single machine dual position based Computational analysis
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部