用进化计算调度特定类型的批处理过程

The 2003 Congress on Evolutionary Computation, 2003. CEC '03. Pub Date : 2003-12-08 DOI:10.1109/CEC.2003.1299771

J. Heinonen, F. Pettersson

{"title":"用进化计算调度特定类型的批处理过程","authors":"J. Heinonen, F. Pettersson","doi":"10.1109/CEC.2003.1299771","DOIUrl":null,"url":null,"abstract":"A genetic algorithm is used to calculate production schedules for a specific type of batch-mode manufacturing process. Previous scheduling efforts included both time discretised MILP as well as continuous-time MILP, both of which were outperformed by the GA when measured in calculation times and final schedule accuracy. The approach is two-folded and an algorithm to reproduce it on similar processes is presented.","PeriodicalId":416243,"journal":{"name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Scheduling a specific type of batch process with evolutionary computation\",\"authors\":\"J. Heinonen, F. Pettersson\",\"doi\":\"10.1109/CEC.2003.1299771\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A genetic algorithm is used to calculate production schedules for a specific type of batch-mode manufacturing process. Previous scheduling efforts included both time discretised MILP as well as continuous-time MILP, both of which were outperformed by the GA when measured in calculation times and final schedule accuracy. The approach is two-folded and an algorithm to reproduce it on similar processes is presented.\",\"PeriodicalId\":416243,\"journal\":{\"name\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2003.1299771\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2003.1299771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

针对一类特定的批量制造过程，采用遗传算法计算生产计划。以前的调度工作包括时间离散MILP和连续时间MILP，当测量计算时间和最终调度精度时，遗传算法优于这两种方法。该方法是双折叠的，并提出了一种在类似过程中复制它的算法。

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

查看原文本刊更多论文

Scheduling a specific type of batch process with evolutionary computation

A genetic algorithm is used to calculate production schedules for a specific type of batch-mode manufacturing process. Previous scheduling efforts included both time discretised MILP as well as continuous-time MILP, both of which were outperformed by the GA when measured in calculation times and final schedule accuracy. The approach is two-folded and an algorithm to reproduce it on similar processes is presented.

求助全文

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

来源期刊

The 2003 Congress on Evolutionary Computation, 2003. CEC '03.

自引率

0.00%

发文量