{"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}
引用次数: 5
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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
