中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Time-window-based combined objective DE algorithm for hybrid flow-shop

文献类型:期刊论文

作者Han ZH(韩忠华); Shi HB(史海波); Yao LL(姚丽丽)
刊名International Journal of Modelling, Identification and Control
出版日期2014
卷号21期号:3页码:295-305
关键词Evolutionary algorithms Global optimization Production control Production engineering Scheduling
ISSN号1746-6172
产权排序1
中文摘要In this paper, a time-window-based hybrid flow-shop scheduling model is presented for manufacturing enterprise for solving production scheduling optimisation problem in the rolling production process. Time window deviation sum and the earliness/tardiness (E/T) penalty sum's optimisation goal are modelled, and differential evolution (DE) global optimisation algorithm is used to conduct the global optimisation. The assigned tasks to determine a job's machining path in the time window frame can be finished in each stage. The hybrid flow-shop scheduling optimisation method based on time window can improve the equipment utilisation and reduce scheduling conflict situations. Our time-window-based hybrid flow-shop scheduling optimisation method is evaluated by multiple sets of programs' numerical analysis, and the results show that the proposed approach can meet the requirement of business rolling production scheduling very well.Copyright
收录类别EI
语种英语
源URL[http://ir.sia.cn/handle/173321/15062]  
专题沈阳自动化研究所_数字工厂研究室
推荐引用方式
GB/T 7714
Han ZH,Shi HB,Yao LL. Time-window-based combined objective DE algorithm for hybrid flow-shop[J]. International Journal of Modelling, Identification and Control,2014,21(3):295-305.
APA Han ZH,Shi HB,&Yao LL.(2014).Time-window-based combined objective DE algorithm for hybrid flow-shop.International Journal of Modelling, Identification and Control,21(3),295-305.
MLA Han ZH,et al."Time-window-based combined objective DE algorithm for hybrid flow-shop".International Journal of Modelling, Identification and Control 21.3(2014):295-305.

入库方式: OAI收割

来源:沈阳自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。