作业重叠柔性作业车间调度的改进遗传算法

2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS) Pub Date : 2017-05-24 DOI:10.1109/ICIS.2017.7960100

Yiyong He, W. Weng, S. Fujimura

{"title":"作业重叠柔性作业车间调度的改进遗传算法","authors":"Yiyong He, W. Weng, S. Fujimura","doi":"10.1109/ICIS.2017.7960100","DOIUrl":null,"url":null,"abstract":"Flexible job-shop scheduling problem (FJSP) is an extended job-shop scheduling problem. FJSP allows an operation to be processed by several different machines. FJSP with overlapping in operations means that each operation is divided into several sublots. Sublots are processed and transferred separately without waiting for the entire operation to be processed. In previous research, a mathematical model was developed and a genetic algorithm proposed to solve this problem. In this study, we try to improve the procedure of previous research to achieve better results. The proposed improvements were tested on some benchmark problems and compared with the results obtained by previous research.","PeriodicalId":301467,"journal":{"name":"2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Improvements to genetic algorithm for flexible job shop scheduling with overlapping in operations\",\"authors\":\"Yiyong He, W. Weng, S. Fujimura\",\"doi\":\"10.1109/ICIS.2017.7960100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Flexible job-shop scheduling problem (FJSP) is an extended job-shop scheduling problem. FJSP allows an operation to be processed by several different machines. FJSP with overlapping in operations means that each operation is divided into several sublots. Sublots are processed and transferred separately without waiting for the entire operation to be processed. In previous research, a mathematical model was developed and a genetic algorithm proposed to solve this problem. In this study, we try to improve the procedure of previous research to achieve better results. The proposed improvements were tested on some benchmark problems and compared with the results obtained by previous research.\",\"PeriodicalId\":301467,\"journal\":{\"name\":\"2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIS.2017.7960100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIS.2017.7960100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

柔性作业车间调度问题(FJSP)是作业车间调度问题的扩展。FJSP允许一个操作由几台不同的机器来处理。具有重叠操作的FJSP意味着每个操作被分成几个子批次。子批分别处理和转移，而不必等待整个操作处理完毕。在以往的研究中，建立了数学模型，并提出了遗传算法来解决这一问题。在本研究中，我们试图改进以往研究的程序，以获得更好的结果。在一些基准问题上对所提出的改进进行了测试，并与前人的研究结果进行了比较。

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

查看原文本刊更多论文

Improvements to genetic algorithm for flexible job shop scheduling with overlapping in operations

Flexible job-shop scheduling problem (FJSP) is an extended job-shop scheduling problem. FJSP allows an operation to be processed by several different machines. FJSP with overlapping in operations means that each operation is divided into several sublots. Sublots are processed and transferred separately without waiting for the entire operation to be processed. In previous research, a mathematical model was developed and a genetic algorithm proposed to solve this problem. In this study, we try to improve the procedure of previous research to achieve better results. The proposed improvements were tested on some benchmark problems and compared with the results obtained by previous research.

求助全文

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

来源期刊

2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)

自引率

0.00%

发文量