期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
RESEARCH AND PRACTICE FOR MANUFACTURING ENVIRONMENT MODELLING TECHNOLOGY OF CIMS
1
作者 ma dengzhe Jin Ye +1 位作者 Ming Xinguo Yan Junqi(Shanghai Jiaotong University) 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 1994年第3期211-218,224,共17页
An abstract model and representation method for manufacturing environment is presented based on analysis of process planning tasks and factory configuration capable of handling the process plans. This model has been p... An abstract model and representation method for manufacturing environment is presented based on analysis of process planning tasks and factory configuration capable of handling the process plans. This model has been proved to be applicable to the generative process planning and to shopflow control information integration. A general manufacturing environment modelling tool has been developed under the X-window support to verity the mentioned model and modelling technology. 展开更多
关键词 Process planning Manufacturing environment Modelling technology Work-element Manufacturing entity
全文增补中
MULTI-SHOP SCHEDULING PROBLEM 被引量:2
2
作者 HU Yanhai YAN Junqi +2 位作者 ma dengzhe YE Feifan ZHANG Jie 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2007年第3期109-112,共4页
A new concept of multi-shop (M ) is put forward which contains all basic shops including open shop (O), job shop (J ), flow shop (F ) and hybrid flow shop (H ) so that these basic shop can be scheduled toget... A new concept of multi-shop (M ) is put forward which contains all basic shops including open shop (O), job shop (J ), flow shop (F ) and hybrid flow shop (H ) so that these basic shop can be scheduled together. Several algorithms including ant colony optimization (ACO), most work remaining (MWR), least work remaining (LWR), longest processing time (LPT) and shortest processing time (SPT) are used for scheduling the M. Numerical experiments of the M adopting data of some car and reC series benchmark instances are tested. The results show that the ACO algorithm has better performance for scheduling the M than the other algorithms, if minimizing the makespan ( Cmax^*) is taken as the objective function. As a comparison, the separate shops contained in the M are also scheduled by the ACO algorithm for the same objective function, when the completing time of the jobs in the previous shop is taken as the ready time of these jobs in the following shop. The results show that the M has the advantage of shortening the makespan upon separate shops. 展开更多
关键词 Multi-shop scheduling Mixed shop Hybrid flow shop HEURISTICS
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部