AI tools in scheduling problem solving: a solver based on a "well-behaved" restriction of TCSPs

Said Belhadji, A. Isli
{"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}
引用次数: 0

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
调度问题解决中的人工智能工具:基于“行为良好”的tsps限制的求解器
本文的目的是描述一个基于时间约束的作业车间调度问题求解器。求解器的核心是R. Dechter, I. Meiri和J. Pearl(1991)定义的tsps框架的“表现良好”的限制:该限制是一个代数,表示凸约束或两个此类约束的并集。给出了求解器的一般描述,并证明了其完备性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
AI tools in scheduling problem solving: a solver based on a "well-behaved" restriction of TCSPs A deliberative and reactive diagnosis agent based on logic programming Subdefinite models as a variety of constraint programming Oz Scheduler: a workbench for scheduling problems Automatic scale selection as a pre-processing stage to interpreting real-world data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1