Block structured scheduling using constraint logic programming

[1]  Oscar Castillo,et al.  A state of the art review of intelligent scheduling , 2018, Artificial Intelligence Review.

[2]  Yves Lespérance,et al.  A planning approach to the automated synthesis of template-based process models , 2017, Service Oriented Computing and Applications.

[3]  Kresimir Fertalj,et al.  Building a BPM application in an SOA-based legacy environment , 2019, Comput. Sci. Inf. Syst..

[4]  Grzegorz J. Nalepa,et al.  The HeKatE methodology. Hybrid engineering of intelligent systems , 2010, Int. J. Appl. Math. Comput. Sci..

[5]  Prashant J. Shenoy,et al.  Sharing-aware algorithms for virtual machine colocation , 2011, SPAA '11.

[6]  Sander J. J. Leemans,et al.  Discovering Block-Structured Process Models from Event Logs - A Constructive Approach , 2013, Petri Nets.

[7]  Costin Badica,et al.  Modeling Block Structured Project Scheduling with Resource Constraints , 2019, LSSC.

[8]  Wil M. P. van der Aalst,et al.  A Declarative Approach for Flexible Business Processes Management , 2006, Business Process Management Workshops.

[9]  Hafedh Mili,et al.  Business process modeling languages: Sorting through the alphabet soup , 2010, CSUR.

[10]  Costin Badica,et al.  Greedy Heuristics for Automatic Synthesis of Efficient Block-Structured Scheduling Processes from Declarative Specifications , 2018, AIAI.

[11]  Mirjana Ivanović,et al.  A CLP approach for solving the maximum clique problem: Benefits and limits , 2017, 2017 21st International Conference on System Theory, Control and Computing (ICSTCC).

[12]  Chitta Baral,et al.  Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming , 2001, LPNMR.

[13]  Yuliya Lierler,et al.  What is answer set programming to propositional satisfiability , 2017, Constraints.

[14]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[15]  James E. Kelley,et al.  Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Costin Badica,et al.  Exploring the Space of Block Structured Scheduling Processes Using Constraint Logic Programming , 2019, IDC.

[18]  Klemens Böhm,et al.  Process Synthesis with Sequential and Parallel Constraints , 2016, OTM Conferences.

[19]  Costin Badica,et al.  Declarative Representation and Solution of Vehicle Routing with Pickup and Delivery Problem , 2017, ICCS.

[20]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[21]  Andrea Marrella,et al.  Automated Planning for Business Process Management , 2018, Journal on Data Semantics.

[22]  Robert Pellerin,et al.  A survey of hybrid metaheuristics for the resource-constrained project scheduling problem , 2020, Eur. J. Oper. Res..

[23]  Andreas Pfandler,et al.  Democratix: A Declarative Approach to Winner Determination , 2015, ADT.

[24]  Sharad Malik,et al.  Boolean satisfiability from theoretical hardness to practical success , 2009, Commun. ACM.

[25]  Kish Shen,et al.  Under consideration for publication in Theory and Practice of Logic Programming , 2003 .

[26]  Diogo R. Ferreira,et al.  An Integrated Life Cycle for Workflow Management Based on Learning and Planning , 2006, Int. J. Cooperative Inf. Syst..

[27]  David Camacho,et al.  A knowledge-based approach for business process reengineering, SHAMASH , 2002, Knowl. Based Syst..