Flow shop scheduling with a batch processor and limited buffer | |
Zhang, Cheng ; Shi, Zhongshun ; Huang, Zewen ; Wu, Yifan ; Shi, Leyuan | |
刊名 | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH |
2017 | |
关键词 | batch processor limited buffer flow shop total completion time differential evolution INCOMPATIBLE JOB FAMILIES DIFFERENTIAL EVOLUTION GENETIC ALGORITHMS 2-STAGE FLOWSHOP SETUP TIMES MACHINE OPTIMIZATION BLOCKING STORAGE |
DOI | 10.1080/00207543.2016.1268730 |
英文摘要 | This paper addresses flow shop scheduling problem with a batch processor followed by a discrete processor. Incompatible job families and limited buffer size are considered, and the objective is to determine a schedule such that the total completion time is minimised. Flexible buffer service policy is designed, and a greedy heuristic together with the worst-case analysis is developed. We also propose a hybrid method involving a Differential Evolution algorithm. Moreover, two tight lower bounds are provided to measure the performances of the proposed algorithms. Numerical results demonstrate that the proposed algorithms are capable of providing high-quality solutions for large-scale problems within a reasonable computational time.; National Science Foundation [CMMI-1435800, CMMI-1536978]; National Science Foundation of China [71371015, 71690232]; SCI(E); ARTICLE; 11; 3217-3233; 55 |
语种 | 英语 |
内容类型 | 期刊论文 |
源URL | [http://ir.pku.edu.cn/handle/20.500.11897/476078] |
专题 | 工学院 |
推荐引用方式 GB/T 7714 | Zhang, Cheng,Shi, Zhongshun,Huang, Zewen,et al. Flow shop scheduling with a batch processor and limited buffer[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH,2017. |
APA | Zhang, Cheng,Shi, Zhongshun,Huang, Zewen,Wu, Yifan,&Shi, Leyuan.(2017).Flow shop scheduling with a batch processor and limited buffer.INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. |
MLA | Zhang, Cheng,et al."Flow shop scheduling with a batch processor and limited buffer".INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2017). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论