不相关机器上延迟工作调度的精确方法

IF 1.6 4区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS International Journal of Applied Mathematics and Computer Science Pub Date : 2023-06-01 DOI:10.34768/amcs-2023-0021

Xinbo Liu, Wen Wang, Xin Chen, Małgorzata Sterna, J. Błażewicz

{"title":"不相关机器上延迟工作调度的精确方法","authors":"Xinbo Liu, Wen Wang, Xin Chen, Małgorzata Sterna, J. Błażewicz","doi":"10.34768/amcs-2023-0021","DOIUrl":null,"url":null,"abstract":"Abstract We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a dynamic programming algorithm. The time efficiencies of all three approaches are evaluated through computational experiments.","PeriodicalId":50339,"journal":{"name":"International Journal of Applied Mathematics and Computer Science","volume":"30 1","pages":"285 - 295"},"PeriodicalIF":1.6000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Exact Approaches to Late Work Scheduling on Unrelated Machines\",\"authors\":\"Xinbo Liu, Wen Wang, Xin Chen, Małgorzata Sterna, J. Błażewicz\",\"doi\":\"10.34768/amcs-2023-0021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a dynamic programming algorithm. The time efficiencies of all three approaches are evaluated through computational experiments.\",\"PeriodicalId\":50339,\"journal\":{\"name\":\"International Journal of Applied Mathematics and Computer Science\",\"volume\":\"30 1\",\"pages\":\"285 - 295\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2023-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Applied Mathematics and Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.34768/amcs-2023-0021\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Applied Mathematics and Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.34768/amcs-2023-0021","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

摘要研究了不相关并行机器上的调度问题，以使总延误量最小化。由于这个问题是np困难的，我们提出了一个数学模型和两个专门的精确的方法来解决它，基于分支和边界策略和枚举结合动态规划算法。通过计算实验对三种方法的时间效率进行了评价。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Exact Approaches to Late Work Scheduling on Unrelated Machines

Abstract We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a dynamic programming algorithm. The time efficiencies of all three approaches are evaluated through computational experiments.

求助全文

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

来源期刊

International Journal of Applied Mathematics and Computer Science 工程技术-计算机：人工智能

CiteScore

4.10

自引率

21.10%

发文量

审稿时长

4.2 months

期刊介绍： The International Journal of Applied Mathematics and Computer Science is a quarterly published in Poland since 1991 by the University of Zielona Góra in partnership with De Gruyter Poland (Sciendo) and Lubuskie Scientific Society, under the auspices of the Committee on Automatic Control and Robotics of the Polish Academy of Sciences. The journal strives to meet the demand for the presentation of interdisciplinary research in various fields related to control theory, applied mathematics, scientific computing and computer science. In particular, it publishes high quality original research results in the following areas: -modern control theory and practice- artificial intelligence methods and their applications- applied mathematics and mathematical optimisation techniques- mathematical methods in engineering, computer science, and biology.