Treffer: Block structured scheduling using constraint logic programming.

We propose a Constraint Logic Programming approach for synthesizing block-structured scheduling processes with ordering constraints. Then we extend the model to allow specification of resource constraints. Our goal is to design optimization algorithms. We combine block structured modeling of business processes with results from project scheduling literature. Differently from standard approaches, here we focus on block structured scheduling processes. Our main achievement is the formulation of an abstract mathematical model of block-structured resource-constrained scheduling processes. We tested the correctness and feasibility of our approach using an experimental prototype based on Constraint Logic Programming developed using ECLiPSe-CLP system. [ABSTRACT FROM AUTHOR]

Copyright of AI Communications is the property of Sage Publications Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)