基于蚁群系统的单机调度方法:加权延迟调度问题

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI:10.1109/NaBIC.2012.6402244

A. Madureira, D. Falcao, I. Pereira

{"title":"基于蚁群系统的单机调度方法:加权延迟调度问题","authors":"A. Madureira, D. Falcao, I. Pereira","doi":"10.1109/NaBIC.2012.6402244","DOIUrl":null,"url":null,"abstract":"The paper introduces an approach to solve the problem of generating a sequence of jobs that minimizes the total weighted tardiness for a set of jobs to be processed in a single machine. An Ant Colony System based algorithm is validated with benchmark problems available in the OR library. The obtained results were compared with the best available results and were found to be nearer to the optimal. The obtained computational results allowed concluding on their efficiency and effectiveness.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Ant Colony System based approach to single machine scheduling problems: Weighted tardiness scheduling problem\",\"authors\":\"A. Madureira, D. Falcao, I. Pereira\",\"doi\":\"10.1109/NaBIC.2012.6402244\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper introduces an approach to solve the problem of generating a sequence of jobs that minimizes the total weighted tardiness for a set of jobs to be processed in a single machine. An Ant Colony System based algorithm is validated with benchmark problems available in the OR library. The obtained results were compared with the best available results and were found to be nearer to the optimal. The obtained computational results allowed concluding on their efficiency and effectiveness.\",\"PeriodicalId\":103091,\"journal\":{\"name\":\"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NaBIC.2012.6402244\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaBIC.2012.6402244","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

本文介绍了一种方法来解决在一台机器上处理的一组作业的产生顺序问题，该问题使总加权延迟最小化。利用OR库中的基准问题对基于蚁群系统的算法进行了验证。将所得结果与现有最佳结果进行比较，发现更接近最佳。得到的计算结果可以对它们的效率和有效性作出结论。

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

查看原文本刊更多论文

Ant Colony System based approach to single machine scheduling problems: Weighted tardiness scheduling problem

The paper introduces an approach to solve the problem of generating a sequence of jobs that minimizes the total weighted tardiness for a set of jobs to be processed in a single machine. An Ant Colony System based algorithm is validated with benchmark problems available in the OR library. The obtained results were compared with the best available results and were found to be nearer to the optimal. The obtained computational results allowed concluding on their efficiency and effectiveness.

求助全文

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

来源期刊

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)

自引率

0.00%

发文量