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 busines...
Saved in:
Published in | Ai communications Vol. 33; no. 1; pp. 41 - 57 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Amsterdam
IOS Press BV
01.01.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISSN: | 0921-7126 1875-8452 |
DOI: | 10.3233/AIC-200650 |