多种目标函数下资源均衡问题的遗传算法

2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR) Pub Date : 2022-08-22 DOI:10.1109/MMAR55195.2022.9874286

Grzegorz Waligóra

{"title":"多种目标函数下资源均衡问题的遗传算法","authors":"Grzegorz Waligóra","doi":"10.1109/MMAR55195.2022.9874286","DOIUrl":null,"url":null,"abstract":"In this paper some resource leveling problems for project scheduling under resource constraints are considered. In this problem activities of a project are to be scheduled in a way that all precedence and resource constraints are satisfied, and a given objective function describing the fluctuations of resource usage is minimized. Activities are nonpreemptable, and resources are renewable. Several various objective functions for the problem are analyzed. A genetic algorithm is proposed to solve this strongly NP-hard problem. The performance of the algorithm is examined and compared to other simple heuristics on a basis of a computational experiment performed on a set of standard benchmark instances.","PeriodicalId":169528,"journal":{"name":"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Genetic Algorithm for Resource Leveling Problems under Various Objective Functions\",\"authors\":\"Grzegorz Waligóra\",\"doi\":\"10.1109/MMAR55195.2022.9874286\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper some resource leveling problems for project scheduling under resource constraints are considered. In this problem activities of a project are to be scheduled in a way that all precedence and resource constraints are satisfied, and a given objective function describing the fluctuations of resource usage is minimized. Activities are nonpreemptable, and resources are renewable. Several various objective functions for the problem are analyzed. A genetic algorithm is proposed to solve this strongly NP-hard problem. The performance of the algorithm is examined and compared to other simple heuristics on a basis of a computational experiment performed on a set of standard benchmark instances.\",\"PeriodicalId\":169528,\"journal\":{\"name\":\"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMAR55195.2022.9874286\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMAR55195.2022.9874286","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

研究了资源约束下项目调度中的资源均衡问题。在这个问题中，项目的活动要以满足所有优先级和资源约束的方式进行安排，并且描述资源使用波动的给定目标函数要最小化。活动是不可抢占的，资源是可再生的。分析了该问题的几种不同目标函数。提出了一种遗传算法来解决这一强np困难问题。通过在一组标准基准实例上进行计算实验，对该算法的性能进行了检查，并与其他简单的启发式算法进行了比较。

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

查看原文本刊更多论文

Genetic Algorithm for Resource Leveling Problems under Various Objective Functions

In this paper some resource leveling problems for project scheduling under resource constraints are considered. In this problem activities of a project are to be scheduled in a way that all precedence and resource constraints are satisfied, and a given objective function describing the fluctuations of resource usage is minimized. Activities are nonpreemptable, and resources are renewable. Several various objective functions for the problem are analyzed. A genetic algorithm is proposed to solve this strongly NP-hard problem. The performance of the algorithm is examined and compared to other simple heuristics on a basis of a computational experiment performed on a set of standard benchmark instances.

求助全文

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

来源期刊

2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)

自引率

0.00%

发文量