Application of GATS, a hybrid mega-heuristic model,and DOE, to solve flexible flow shop scheduling problems:a case study

Phong Nguyen Nhu, Thu Trang Nguyen Le
{"title":"Application of GATS, a hybrid mega-heuristic model,and DOE, to solve flexible flow shop scheduling problems:a case study","authors":"Phong Nguyen Nhu, Thu Trang Nguyen Le","doi":"10.54646/bijomrp.2023.14","DOIUrl":null,"url":null,"abstract":"Flexible flow shop scheduling (FFSS) is an NP-hard combinatorial optimization problem. Solving this problem using mathematical modeling approaches is very difficult. Mega-heuristic algorithms, such as the genetic algorithm (GA) and tabu search (TS), are powerful tools for finding near-optimal solutions to problems of this type. This paper develops a GATS model by combining GA and TS for solving FFSS problems. In the model, GA is used as the platform for global search, and TS is used to support GA in local search. This paper also uses the design of experiments (DOE) to optimize the parameters of the GATS model. The performance of the models, GATS and GATS with DOE, is compared with traditional heuristics being used. The result indicates that the models are good approaches for FFSS problems.","PeriodicalId":433289,"journal":{"name":"BOHR International Journal of Operations Management Research and Practices","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"BOHR International Journal of Operations Management Research and Practices","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.54646/bijomrp.2023.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Flexible flow shop scheduling (FFSS) is an NP-hard combinatorial optimization problem. Solving this problem using mathematical modeling approaches is very difficult. Mega-heuristic algorithms, such as the genetic algorithm (GA) and tabu search (TS), are powerful tools for finding near-optimal solutions to problems of this type. This paper develops a GATS model by combining GA and TS for solving FFSS problems. In the model, GA is used as the platform for global search, and TS is used to support GA in local search. This paper also uses the design of experiments (DOE) to optimize the parameters of the GATS model. The performance of the models, GATS and GATS with DOE, is compared with traditional heuristics being used. The result indicates that the models are good approaches for FFSS problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大启发式混合模型GATS与DOE在柔性流水车间调度问题中的应用
柔性流水车间调度是一个NP-hard组合优化问题。用数学建模的方法来解决这个问题是非常困难的。大型启发式算法,如遗传算法(GA)和禁忌搜索(TS),是为这类问题找到接近最优解的强大工具。本文将遗传算法与TS相结合,建立了求解FFSS问题的GATS模型。该模型采用遗传算法作为全局搜索平台,采用TS技术支持遗传算法进行局部搜索。本文还采用实验设计(DOE)对GATS模型的参数进行了优化。将GATS模型和带DOE的GATS模型的性能与传统的启发式方法进行了比较。结果表明,该模型是求解FFSS问题的良好方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Curriculum Management Practices by Head of Schools: Empirical Evidence from Secondary Schools in the Nnewi Education Zone Reconfiguring a multi-period facility model—An empirical test in a dynamic setting Entrepreneurship Education Development Strategies to Increase Students’ Entrepreneurship Intentions in Bali Adjustment of patterns of women’s trousers on the baseof the lower body Enjoyment in academic pursuit and performance improvement
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1