Block structured scheduling using constraint logic programming

Article type: Research Article

Authors: Bădică, Amelia^{a; *} | Bădică, Costin^b | Ivanović, Mirjana^c

Affiliations: [a] Department of Statistics and Business Informatics, University of Craiova, Craiova, Romania. E-mail: ameliabd@yahoo.com | [b] Department of Computers and Information Technology, University of Craiova, Craiova, Romania. E-mail: cbadica@software.ucv.ro | [c] Department of Mathematics and Informatics, University of Novi Sad, Novi Sad, Serbia. E-mail: mira@dmi.uns.ac.rs

Correspondence: [*] Corresponding author. E-mail: ameliabd@yahoo.com.

Abstract: 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.

Keywords: Planning & scheduling, constraint logic programming, optimization

DOI: 10.3233/AIC-200650

Journal: AI Communications, vol. 33, no. 1, pp. 41-57, 2020