并行非同构批处理机器调度的遗传算法

2007 IEEE Symposium on Computational Intelligence in Scheduling Pub Date : 2007-04-01 DOI:10.1109/SCIS.2007.367682

Shubin Xu, J. C. Bean

{"title":"并行非同构批处理机器调度的遗传算法","authors":"Shubin Xu, J. C. Bean","doi":"10.1109/SCIS.2007.367682","DOIUrl":null,"url":null,"abstract":"In this paper, we study the scheduling problem of minimizing makespan on parallel non-identical batch processing machines. We formulate the scheduling problem into an integer programming model. Due to the difficulty of the problem, it is hard to solve the problem with standard mathematical programming software. We propose a genetic algorithm based on random keys encoding to address this problem. Computational results show that this genetic algorithm consistently finds a solution in a reasonable amount of computation time","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"55","resultStr":"{\"title\":\"A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines\",\"authors\":\"Shubin Xu, J. C. Bean\",\"doi\":\"10.1109/SCIS.2007.367682\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the scheduling problem of minimizing makespan on parallel non-identical batch processing machines. We formulate the scheduling problem into an integer programming model. Due to the difficulty of the problem, it is hard to solve the problem with standard mathematical programming software. We propose a genetic algorithm based on random keys encoding to address this problem. Computational results show that this genetic algorithm consistently finds a solution in a reasonable amount of computation time\",\"PeriodicalId\":184726,\"journal\":{\"name\":\"2007 IEEE Symposium on Computational Intelligence in Scheduling\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"55\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Symposium on Computational Intelligence in Scheduling\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCIS.2007.367682\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Symposium on Computational Intelligence in Scheduling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCIS.2007.367682","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 55

摘要

本文研究了并行非同构批处理机器上最大完工时间的调度问题。我们将调度问题化为一个整数规划模型。由于问题的艰难性，很难用标准的数学规划软件来解决。我们提出了一种基于随机密钥编码的遗传算法来解决这个问题。计算结果表明，该遗传算法在合理的计算时间内始终能找到一个解

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

查看原文本刊更多论文

A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines

In this paper, we study the scheduling problem of minimizing makespan on parallel non-identical batch processing machines. We formulate the scheduling problem into an integer programming model. Due to the difficulty of the problem, it is hard to solve the problem with standard mathematical programming software. We propose a genetic algorithm based on random keys encoding to address this problem. Computational results show that this genetic algorithm consistently finds a solution in a reasonable amount of computation time

求助全文

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

来源期刊

2007 IEEE Symposium on Computational Intelligence in Scheduling

自引率

0.00%

发文量