Scheduling for Re-entrant Hybrid Flowshop Based on Wolf Pack Algorithm
文献类型：会议论文
| 作者 | Han ZH(韩忠华)2,3 ; Tian, Xutian1; Ma, Xiaofu4; Lin S(林硕)2
|
| 出版日期 | 2018 |
| 会议日期 | May 23-26, 2018 |
| 会议地点 | China |
| 页码 | 2018 International Conference on Advanced Materials, Intelligent Manufacturing and Automation - 2. Modeling, Analysis, Simulation and Scheduling of Manufacturing Processes |
| 英文摘要 | In order to solve the scheduling problems of Re-entrant Hybrid Flowshop (RHFS), this paper investigates the mathematical programming model of RHFS, and proposes the wolf pack based algorithm (WPA) as a global optimization method. Multi-Sticking Crape Masking procedure scheduling problems in painting workshop of a bus manufacturing enterprise are of typical features of RHFS. We regard it as an application objective of the proposed algorithm, applying WPA and multiple evolutionary algorithms to solve the problems. The results show that the algorithm can solve re-entrant scheduling problems of hybrid flowshop more effectively compared with other conventional methods. |
| 源文献作者 | Nanjing University of Information Science and Technology ; University of Information Technology |
| 产权排序 | 1 |
| 会议录 | IOP Conference Series: Materials Science and Engineering
 |
| 会议录出版者 | IOP |
| 会议录出版地 | Bristol, UK |
| 语种 | 英语 |
| ISSN号 | 1757-8981 |
| 源URL | [http://119.78.100.139/handle/173321/22364]  |
| 专题 | 沈阳自动化研究所_数字工厂研究室 |
| 通讯作者 | Han ZH(韩忠华) |
| 作者单位 | 1.Information and Control Engineering Faculty, Shenyang Jianzhu University, Liaoning 110168, China 2.Faculty of Information and Control Engineering, Shenyang Jianzhu University, Liaoning 110168, China 3.Digital Factory Department, Shenyang Institute of Automation, CAS, Shenyang 110016, China 4.Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA 24060, United States |
| 推荐引用方式 GB/T 7714 | Han ZH,Tian, Xutian,Ma, Xiaofu,et al. Scheduling for Re-entrant Hybrid Flowshop Based on Wolf Pack Algorithm[C]. 见:. China. May 23-26, 2018. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。