a shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents：一个蛙跳两剂混合流水车间调度算法.pdfVIP

下载本文档

4
0
约 7页
2016-03-12 发布于广东
举报
版权申诉

a shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents：一个蛙跳两剂混合流水车间调度算法.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

a shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents：一个蛙跳两剂混合流水车间调度算法

Expert Systems With Applications 42 (2015) 9333–9339 Contents lists available at ScienceDirect Expert Systems With Applications journal homepage: /locate/eswa A shuﬄed frog-leaping algorithm for hybrid ﬂow shop scheduling with two agents Deming Lei a,∗, Xiuping Guo b a School of Automation, Wuhan University of Technology, Wuhan 430070, PR China b School of Economic and Management, Southwest Jiaotong University, Chengdu 610031, PR China a r t i c l e i n f o a b s t r a c t Keywords: Two-agent scheduling problem has attracted much attention; however, two-agent hybrid ﬂow shop schedul- Hybrid ﬂow shop scheduling ing problem (TAHFSP) is seldom studied. In this study, TAHFSP and its minimality model are considered and Shuﬄed frog-leaping algorithm a novel shuﬄed frog-leaping algorithm (SFLA) is proposed is to minimize the sum of the objectives of two Minimality model agents. The following new principles are applied in SFLA: a tournament selection based method is used to Two agents divide population, not all solutions of population are allocated into memeplexes, the best solution of each memeplex acts as the object of the search process and the search process within memeplex consists of the global searches on two sub-problems sequentially and multiple neighborhood search. We test the perfor- mance of SFLA using a number of instances and the experimental results show the notable advantage of