Constraint satisfaction techniques in planning and scheduling: An introduction

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F08%3A00100647" target="_blank" >RIV/00216208:11320/08:00100647 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Constraint satisfaction techniques in planning and scheduling: An introduction
Original language description
Planning and scheduling are two closely related areas that, despite their similarity, deal with different problems. While the planning task is to decide which actions are necessary to achieve a given goal, the scheduling task is to allocate known activities to scarce resources, such as machines, over time. Typically planning and scheduling problems are solved separately using different solving techniques. However, real-life problems require a more integrated approach. Constraint satisfaction seems to besuch a unifying solving technology for both planning and scheduling problems. This paper describes how constraint satisfaction techniques can be applied to planning and scheduling problems.
Czech name
Úvod do technik splňování omezujících podmínek v plánování a rozvrhování
Czech description
Článek podává úvod do technik splňování omezujících podmínek a jejich použití v plánování a rozvrhování

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)