Hostname: page-component-78c5997874-v9fdk Total loading time: 0 Render date: 2024-11-17T18:16:24.940Z Has data issue: false hasContentIssue false

Introduction to the special issue on constraint satisfaction for planning and scheduling

Published online by Cambridge University Press:  22 February 2017

Miguel A. Salido
Affiliation:
Instituto de Automatica e Informatica Industrial, Universitat Politecnica de Valencia, Camino de vera s/n 46022, Valencia, Spain e-mail: msalido@dsic.upv.es
Roman Barták
Affiliation:
Faculty of Mathematics and Physics, Charles University, Malostranske nam. 2/25, 118 00 Praha 1, Czech Republic e-mail: bartak@ktiml.mff.cuni.cz

Abstract

The areas of Artificial Intelligence planning and scheduling have seen important advances thanks to the application of constraint satisfaction models and techniques. Especially, solutions to many real-world problems need to integrate plan synthesis capabilities with resource allocation, which can be efficiently managed by using constraint satisfaction techniques. Constraint satisfaction plays an important role in solving such real life problems, and integrated techniques that manage planning and scheduling with constraint satisfaction are particularly useful.

Type
Introduction
Copyright
© Cambridge University Press, 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)