{"title":"Balancing antagonistic time and resource utilization constraints in over-subscribed scheduling problems","authors":"S.F. Smith, D. Pathak","doi":"10.1109/CAIA.1992.200018","DOIUrl":null,"url":null,"abstract":"Previous research has demonstrated the utility of constraint-based problem structuring and multiperspective scheduling for effective balancing conflicting objects in constraint-relaxable scheduling problems. Work aimed at applying these concepts to over-subscribed scheduling problems is discussed. The focus is on the problem of constructing short-term schedules for the Hubble Space Telescope, where complex state-dependent constraints on resource utilization interact antagonistically with the ability to satisfy absolute time constraints on execution of goal activities. Two time-bounded heuristic scheduling strategies were defined. The performance of each in balancing this tradeoff was studied experimentally. On the basis of results indicating the differential superiority of each strategy, a composite multiperspective strategy based on recognition of characteristics of the current problem-solving state is defined. Its experimental performance indicates the benefits of constraint-based problem structuring in over-subscribed domains.<<ETX>>","PeriodicalId":388685,"journal":{"name":"Proceedings Eighth Conference on Artificial Intelligence for Applications","volume":"115 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth Conference on Artificial Intelligence for Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAIA.1992.200018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
Abstract
Previous research has demonstrated the utility of constraint-based problem structuring and multiperspective scheduling for effective balancing conflicting objects in constraint-relaxable scheduling problems. Work aimed at applying these concepts to over-subscribed scheduling problems is discussed. The focus is on the problem of constructing short-term schedules for the Hubble Space Telescope, where complex state-dependent constraints on resource utilization interact antagonistically with the ability to satisfy absolute time constraints on execution of goal activities. Two time-bounded heuristic scheduling strategies were defined. The performance of each in balancing this tradeoff was studied experimentally. On the basis of results indicating the differential superiority of each strategy, a composite multiperspective strategy based on recognition of characteristics of the current problem-solving state is defined. Its experimental performance indicates the benefits of constraint-based problem structuring in over-subscribed domains.<>