优先约束和任务:有多少个任务排序?

1990 IEEE International Conference on Systems Engineering Pub Date : 1990-08-09 DOI:10.1109/ICSYSE.1990.203183

J. M. Miller, G. Stockman

{"title":"优先约束和任务:有多少个任务排序?","authors":"J. M. Miller, G. Stockman","doi":"10.1109/ICSYSE.1990.203183","DOIUrl":null,"url":null,"abstract":"An improved algorithm for determining the number of task orderings for a set of tasks and precedence constraints is presented. Precedence graphs are used to represent the tasks and constraints. A subgraph replacement strategy acts as an oracle in determining the exact number of task orderings for a class of NX-fold graphs. For non-NX-fold graphs the oracle computes, in low-order polynomial time, bounds on the number of orders","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Precedence constraints and tasks: how many task orderings?\",\"authors\":\"J. M. Miller, G. Stockman\",\"doi\":\"10.1109/ICSYSE.1990.203183\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An improved algorithm for determining the number of task orderings for a set of tasks and precedence constraints is presented. Precedence graphs are used to represent the tasks and constraints. A subgraph replacement strategy acts as an oracle in determining the exact number of task orderings for a class of NX-fold graphs. For non-NX-fold graphs the oracle computes, in low-order polynomial time, bounds on the number of orders\",\"PeriodicalId\":259801,\"journal\":{\"name\":\"1990 IEEE International Conference on Systems Engineering\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1990 IEEE International Conference on Systems Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSYSE.1990.203183\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1990 IEEE International Conference on Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSYSE.1990.203183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

提出了一种用于确定任务集的任务排序数和优先约束的改进算法。优先图用于表示任务和约束。子图替换策略在确定一类NX-fold图的任务排序的确切数量时充当了一个预言器。对于非nx -fold图，oracle在低阶多项式时间内计算阶数的界限

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

查看原文本刊更多论文

Precedence constraints and tasks: how many task orderings?

An improved algorithm for determining the number of task orderings for a set of tasks and precedence constraints is presented. Precedence graphs are used to represent the tasks and constraints. A subgraph replacement strategy acts as an oracle in determining the exact number of task orderings for a class of NX-fold graphs. For non-NX-fold graphs the oracle computes, in low-order polynomial time, bounds on the number of orders

求助全文

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

来源期刊

1990 IEEE International Conference on Systems Engineering

自引率

0.00%

发文量