{"title":"调度问题解决中的人工智能工具:基于“行为良好”的tsps限制的求解器","authors":"Said Belhadji, A. Isli","doi":"10.1109/TAI.1996.560772","DOIUrl":null,"url":null,"abstract":"The aim of the paper is to describe a temporal constraint based solver for (job shop) scheduling problems. The heart of the solver is a \"well behaved\" restriction of the framework of TCSPs defined by R. Dechter, I. Meiri and J. Pearl (1991): the restriction is an algebra and expresses convex constraints or unions of two such constraints. We give a general description of the solver and show its completeness.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"37 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"AI tools in scheduling problem solving: a solver based on a \\\"well-behaved\\\" restriction of TCSPs\",\"authors\":\"Said Belhadji, A. Isli\",\"doi\":\"10.1109/TAI.1996.560772\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The aim of the paper is to describe a temporal constraint based solver for (job shop) scheduling problems. The heart of the solver is a \\\"well behaved\\\" restriction of the framework of TCSPs defined by R. Dechter, I. Meiri and J. Pearl (1991): the restriction is an algebra and expresses convex constraints or unions of two such constraints. We give a general description of the solver and show its completeness.\",\"PeriodicalId\":209171,\"journal\":{\"name\":\"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence\",\"volume\":\"37 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1996.560772\",\"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 Eighth IEEE International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1996.560772","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本文的目的是描述一个基于时间约束的作业车间调度问题求解器。求解器的核心是R. Dechter, I. Meiri和J. Pearl(1991)定义的tsps框架的“表现良好”的限制:该限制是一个代数，表示凸约束或两个此类约束的并集。给出了求解器的一般描述，并证明了其完备性。
AI tools in scheduling problem solving: a solver based on a "well-behaved" restriction of TCSPs
The aim of the paper is to describe a temporal constraint based solver for (job shop) scheduling problems. The heart of the solver is a "well behaved" restriction of the framework of TCSPs defined by R. Dechter, I. Meiri and J. Pearl (1991): the restriction is an algebra and expresses convex constraints or unions of two such constraints. We give a general description of the solver and show its completeness.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
