.png){kind=icon}
返回
Makespan minimisation in flexible flowshop sequence-dependent group scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2013.825055.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this research, the flexible flowshop sequence-dependent group scheduling problem with minimisation of makespan as the criterion (FFm vertical bar fmls, s(hgi vertical bar)C(max)) is investigated. A mixed integer linear mathematical model for the research problem is developed. Since the research problem is shown to be NP-hard, a meta-heuristic algorithm based on memetic algorithm (MA) is developed to efficiently solve the problem. Also, a lower bounding technique based on the developed mathematical model is proposed to evaluate the quality of the proposed MA. The performance of the proposed MA is compared with the existing algorithm in the literature, i.e. tabu search (TS), by solving the available test problems in the literature. A comparison based on paired t-test shows that the average makespan of the proposed MA is 3% lower than the average makespan of the TS. The average percentage gap of MA for small-size problems comparing with the optimal solution is 0.8%. Also, the average percentage gap of the proposed MA compared to the proposed lower bound for medium-size test problems (problems up to 65 jobs in all groups) is 5%.
Keyword:
flexible flowshop scheduling
sequence-dependent group scheduling
metaheuristics
memetic algorithm
lower bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
PREAI
分享收藏
查看更多内容