加工时间约束下调度的多项式时间算法

Proceedings of the 2019 9th International Conference on Communication and Network Security Pub Date : 2019-11-15 DOI:10.1145/3371676.3371690

Xuerong Yue, Jiji Gao, Zhibin Chen

{"title":"加工时间约束下调度的多项式时间算法","authors":"Xuerong Yue, Jiji Gao, Zhibin Chen","doi":"10.1145/3371676.3371690","DOIUrl":null,"url":null,"abstract":"Given m parallel machines and n jobs with each job having a processing time, the classical scheduling, a famous NP-hard problem, wants to find a way to schedule all jobs on m machines such that the makespan is minimized. In this paper, we consider polynomial time solvability of this problem in some cases when certain conditions on processing times are being imposed. We focus on the case in which the processing times are powers of 2. We design a polynomial-time algorithm that solves this special case. Our result can be generalized to the case when processing times satisfy divisible property.","PeriodicalId":352443,"journal":{"name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Polynomial Time Algorithm for Scheduling on Processing Time Constraints\",\"authors\":\"Xuerong Yue, Jiji Gao, Zhibin Chen\",\"doi\":\"10.1145/3371676.3371690\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given m parallel machines and n jobs with each job having a processing time, the classical scheduling, a famous NP-hard problem, wants to find a way to schedule all jobs on m machines such that the makespan is minimized. In this paper, we consider polynomial time solvability of this problem in some cases when certain conditions on processing times are being imposed. We focus on the case in which the processing times are powers of 2. We design a polynomial-time algorithm that solves this special case. Our result can be generalized to the case when processing times satisfy divisible property.\",\"PeriodicalId\":352443,\"journal\":{\"name\":\"Proceedings of the 2019 9th International Conference on Communication and Network Security\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2019 9th International Conference on Communication and Network Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3371676.3371690\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 9th International Conference on Communication and Network Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3371676.3371690","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

给定m台并行机器和n个作业，每个作业都有一个处理时间，经典调度是一个著名的np困难问题，它希望找到一种方法来调度m台机器上的所有作业，使最大完工时间最小化。本文考虑了在某些情况下，当对加工时间施加一定的条件时，该问题的多项式时间可解性。我们关注处理时间是2的幂的情况。我们设计了一个多项式时间算法来解决这种特殊情况。我们的结果可以推广到处理时间满足可整除性质的情况。

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

查看原文本刊更多论文

A Polynomial Time Algorithm for Scheduling on Processing Time Constraints

Given m parallel machines and n jobs with each job having a processing time, the classical scheduling, a famous NP-hard problem, wants to find a way to schedule all jobs on m machines such that the makespan is minimized. In this paper, we consider polynomial time solvability of this problem in some cases when certain conditions on processing times are being imposed. We focus on the case in which the processing times are powers of 2. We design a polynomial-time algorithm that solves this special case. Our result can be generalized to the case when processing times satisfy divisible property.

求助全文

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

来源期刊

Proceedings of the 2019 9th International Conference on Communication and Network Security

自引率

0.00%

发文量