带活性膜的P系统求解作业车间调度问题

2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics Pub Date : 2015-08-26 DOI:10.1109/IHMSC.2015.272

Laisheng Xiang, Jie Xue

{"title":"带活性膜的P系统求解作业车间调度问题","authors":"Laisheng Xiang, Jie Xue","doi":"10.1109/IHMSC.2015.272","DOIUrl":null,"url":null,"abstract":"This paper focuses on the joint study of membrane computing with job shop scheduling problem. We use membrane to conduct the whole process of computation, which can obtain all possible combinations of operations and machines by evolution rules and calculate the whole computing time by communication rules, complete the order of every artifacts, output the final result through communication rules and division rules. A 3*3 JSSP example is used to indicate the feasibility of the provided algorithm.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"18 1","pages":"242-245"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Solving Job Shop Scheduling Problems by P System with Active Membranes\",\"authors\":\"Laisheng Xiang, Jie Xue\",\"doi\":\"10.1109/IHMSC.2015.272\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper focuses on the joint study of membrane computing with job shop scheduling problem. We use membrane to conduct the whole process of computation, which can obtain all possible combinations of operations and machines by evolution rules and calculate the whole computing time by communication rules, complete the order of every artifacts, output the final result through communication rules and division rules. A 3*3 JSSP example is used to indicate the feasibility of the provided algorithm.\",\"PeriodicalId\":6592,\"journal\":{\"name\":\"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics\",\"volume\":\"18 1\",\"pages\":\"242-245\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IHMSC.2015.272\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IHMSC.2015.272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文主要对膜计算与作业车间调度问题进行联合研究。我们使用膜进行整个计算过程，通过进化规则获得所有可能的操作和机器组合，并通过通信规则计算整个计算时间，完成每个工件的顺序，通过通信规则和除法规则输出最终结果。用一个3*3的JSSP实例说明了所提供算法的可行性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Solving Job Shop Scheduling Problems by P System with Active Membranes

This paper focuses on the joint study of membrane computing with job shop scheduling problem. We use membrane to conduct the whole process of computation, which can obtain all possible combinations of operations and machines by evolution rules and calculate the whole computing time by communication rules, complete the order of every artifacts, output the final result through communication rules and division rules. A 3*3 JSSP example is used to indicate the feasibility of the provided algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics

自引率

0.00%

发文量