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

Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence Pub Date : 1996-11-16 DOI:10.1109/TAI.1996.560772

Said Belhadji, A. Isli

引用次数: 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.

查看原文本刊更多论文

调度问题解决中的人工智能工具:基于“行为良好”的tsps限制的求解器

本文的目的是描述一个基于时间约束的作业车间调度问题求解器。求解器的核心是R. Dechter, I. Meiri和J. Pearl(1991)定义的tsps框架的“表现良好”的限制:该限制是一个代数，表示凸约束或两个此类约束的并集。给出了求解器的一般描述，并证明了其完备性。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence

自引率

0.00%

发文量