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.
R.Aler, D.Borrajo, D.Camacho and A.Sierra-Alonso, A knowledge-based approach for business process reengineering, SHAMASH, Knowledge-Based Systems15(8) (2002), 473–483. doi:10.1016/S0950-7051(02)00032-1.
2.
A.Bădică, C.Bădică, D.Dănciulescu and D.Logofătu, Greedy heuristics for automatic synthesis of efficient block-structured scheduling processes from declarative specifications, in: Artificial Intelligence Applications and Innovations – Proceedings 14th IFIP WG 12.5 International Conference, AIAI 2018, L.S.Iliadis, I.Maglogiannis and V.P.Plagianakos, eds, IFIP Advances in Information and Communication Technology, Vol. 519, Springer, Cham, 2018, pp. 183–195. doi:10.1007/978-3-319-92007-8_16.
3.
A.Bădică, C.Bădică, M.Ivanović and L.Doina, A CLP approach for solving the maximum clique problem: Benefits and limits, in: Proceedings 21st International Conference on System Theory, Control and Computing, ICSTCC 2017, IEEE, 2017, pp. 613–617. doi:10.1109/ICSTCC.2017.8107103.
4.
A.Bădică, C.Bădică, M.Ivanović and D.Logofătu, Exploring the space of block structured scheduling processes using constraint logic programming, in: Intelligent Distributed Computing XIII, Proceedings 13th International Symposium on Intelligent Distributed Computing, IDC 2019, I.V.Kotenko, C.Bădică, V.Desnitsky, D.E.Baz and M.Ivanović, eds, Studies in Computational Intelligence, Vol. 868, Springer, 2019, pp. 149–159. doi:10.1007/978-3-030-32258-8_17.
5.
A.Bădică, C.Bădică, F.Leon and L.Luncean, Declarative representation and solution of vehicle routing with pickup and delivery problem, in: Proceedings International Conference on Computational Science, ICCS 2017, P.Koumoutsakos, M.Lees, V.V.Krzhizhanovskaya, J.J.Dongarra and P.M.A.Sloot, eds, Procedia Computer Science, Vol. 108, Elsevier, 2017, pp. 958–967. doi:10.1016/j.procs.2017.05.261.
6.
A.Bădică, C.Bădică, D.Logofătu, I.Buligiu and L.Ciora, Modeling block structured project scheduling with resource constraints, in: Large-Scale Scientific Computing – Proceedings 12th International Conference, LSSC 2019, I.Lirkov and S.Margenov, eds, Lecture Notes in Computer Science, Vol. 11958, Springer, 2019, pp. 484–492. doi:10.1007/978-3-030-41032-2_55.
7.
C.Baral and C.Uyan, Declarative specification and solution of combinatorial auctions using logic programming, in: Logic Programming and Nonmotonic Reasoning: 6th International Conference, LPNMR 2001 Vienna, Austria, September 17–19, 2001 Proceedings, T.Eiter, W.Faber and M.l.Truszczyński, eds, Lecture Notes in Computer Science, Vol. 2173, Springer Berlin Heidelberg, Berlin, Heidelberg, 2001, pp. 186–199. doi:10.1007/3-540-45402-0_14.
8.
G.Charwat and A.Pfandler, Democratix: A declarative approach to winner determination, in: Algorithmic Decision Theory: 4th International Conference, ADT 2015, Lexington, KY, USA, September 27–30, 2015, Proceedings, T.Walsh, ed., Lecture Notes in Computer Science, Vol. 9346, Springer International Publishing, 2015, pp. 253–269. doi:10.1007/978-3-319-23114-3_16.
9.
M.Dumas, M.La Rosa, J.Mendling and H.A.Reijers, Fundamentals of Business Process Management, 2nd edn, Springer, 2018. doi:10.1007/978-3-662-56509-4.
10.
H.M.Ferreira and D.R.Ferreira, An integrated life cycle for workflow management based on learning and planning, Int. J. Cooperative Inf. Syst.15(4) (2006), 485–505. doi:10.1142/S0218843006001463.
11.
M.R.Garey and D.S.Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979.
12.
W.D.Harvey and M.L.Ginsberg, Limited discrepancy search, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence – Volume 1, IJCAI’95, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1995, pp. 607–613, http://ijcai.org/Proceedings/95-1/Papers/080.pdf.
R.Kolisch and A.Sprecher, PSPLIB – a project scheduling library, European Journal of Operational Research96(1) (1997), 205–216. doi:10.1016/S0377-2217(96)00170-1.
15.
S.J.J.Leemans, D.Fahland and W.M.P.van der Aalst, Discovering block-structured process models from event logs – a constructive approach, in: Application and Theory of Petri Nets and Concurrency – Proceedings 34th International Conference, PETRI NETS 2013, J.M.Colom and J.Desel, eds, Lecture Notes in Computer Science, Vol. 7927, Springer, 2013, pp. 311–329. doi:10.1007/978-3-642-38697-8_17.
16.
Y.Lierler, What is answer set programming to propositional satisfiability, Constraints22(3) (2017), 307–337. doi:10.1007/s10601-016-9257-7.
17.
S.Malik and L.Zhang, Boolean satisfiability: From theoretical hardness to practical success, Communications of the ACM52(8) (2009), 76–82. doi:10.1145/1536616.1536637.
18.
A.Marrella, Automated planning for business process management, J. Data Semantics8(2) (2019), 79–98. doi:10.1007/s13740-018-0096-0.
19.
A.Marrella and Y.Lespérance, A planning approach to the automated synthesis of template-based process models, Service Oriented Computing and Applications11(4) (2017), 367–392. doi:10.1007/s11761-017-0215-z.
20.
M.Matejaš and K.Fertalj, Building a BPM application in an SOA-based legacy environment, Computer Science and Information Systems16(1) (2019), 45–74. doi:10.2298/CSIS171005010M.
21.
H.Mili, G.Tremblay, G.B.Jaoude, E.Lefebvre, L.Elabed and G.El-Boussaidi, Business process modeling languages: Sorting through the alphabet soup, ACM Computing Surveys43(1) (2010), 4:1–4:56. doi:10.1145/1824795.1824799.
22.
R.Mrasek, Automatic synthesis and verification of industrial commissioning processes, PhD thesis, Fakultät für Informatik, Karlsruher Instituts für Technologie, 2016.
23.
R.Mrasek, J.A.Mülle and K.Böhm, Process synthesis with sequential and parallel constraints, in: On the Move to Meaningful Internet Systems: Proceedings OTM 2016 Conferences – Confederated International Conferences: CoopIS, C&TC, and ODBASE 2016, C.Debruyne, H.Panetto, R.Meersman, T.S.Dillon, e.Kühn, D.O’Sullivan and C.A.Ardagna, eds, Lecture Notes in Computer Science, Vol. 10033, 2016, pp. 43–60. doi:10.1007/978-3-319-48472-3_3.
24.
G.Nalepa and A.Ligęza, The HeKatE methodology. Hybrid engineering of intelligent systems, International Journal of Applied Mathematics and Computer Science20(1) (2010), 35–53. doi:10.2478/v10006-010-0003-9.
25.
A.Niederliński, A Gentle Guide to Constraint Logic Programming via ECLiPSe, 3rd edn, Jacek Skalmierski Computer Studio, Gliwice, 2014.
26.
R.Pellerin, N.Perrier and F.Berthaut, A survey of hybrid metaheuristics for the resource-constrained project scheduling problem, European Journal of Operational Research280(2) (2020), 395–416. doi:10.1016/j.ejor.2019.01.063.
27.
M.Pesic and W.M.P.van der Aalst, A declarative approach for flexible business processes management, in: Business Process Management Workshops, Proceedings BPM 2006 International Workshops, BPD, BPI, ENEI, GPWW, DPM, Semantics4ws, J.Eder and S.Dustdar, eds, Lecture Notes in Computer Science, Vol. 4103, Springer, 2006, pp. 169–180. doi:10.1007/11837862_18.
28.
Project Scheduling Problem Library – PSPLIB, http://www.om-db.wi.tum.de/psplib/.
29.
J.Schimpf, Logical loops, in: Logic Programming, 18th International Conference, ICLP 2002, Copenhagen, Denmark, July 29–August 1, 2002, Proceedings, P.J.Stuckey, ed., Lecture Notes in Computer Science, Vol. 2401, Springer, 2002, pp. 224–238. doi:10.1007/3-540-45619-8_16.
30.
J.Schimpf and K.Shen, ECLiPSe – from LP to CLP, Theory and Practice of Logic Programming12(1–2) (2012), 127–156. doi:10.1017/S1471068411000469.
31.
C.Schulte, G.Tack and M.Z.Lagerkvist, Modeling and programming with Gecode, 2019, Available from http://www.gecode.org.
32.
M.Sindelar, R.K.Sitaraman and P.Shenoy, Sharing-aware algorithms for virtual machine colocation, in: Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’11, Association for Computing Machinery, New York, NY, USA, 2011, pp. 367–378. doi:10.1145/1989493.1989554.
33.
The ECLiPSe constraint programming system, available from http://eclipseclp.org/.
34.
J.D.Ullman, NP-complete scheduling problems, Journal of Computer and System Sciences10(3) (1975), 384–393. doi:10.1016/S0022-0000(75)80008-0.
35.
F.Zarandi, M.Hossein, A.A.Sadat Asl, S.Sotudian and O.Castillo, A state of the art review of intelligent scheduling, Artificial Intelligence Review53(1) (2020), 501–593. doi:10.1007/s10462-018-9667-6.
