Modeling Block Structured Project Scheduling with Resource Constraints

  • Amelia Bădică
  • Costin BădicăEmail author
  • Doina Logofătu
  • Ion Buligiu
  • Liviu Ciora
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11958)


We propose a formal model of block-structured project scheduling with resource constraints, with the goal of designing 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 initial experimental prototype based on Constraint Logic Programming.


Project scheduling Process algebra Ordering and resource constraints Constraint Logic Programming 


  1. 1.
    Bădică, A., Bădică, C., Dănciulescu, D., Logofătu, D.: Greedy heuristics for automatic synthesis of efficient block-structured scheduling processes from declarative specifications. In: Iliadis, L., Maglogiannis, I., Plagianakos, V. (eds.) AIAI 2018. IAICT, vol. 519, pp. 183–195. Springer, Cham (2018). Scholar
  2. 2.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Franisco (1979)zbMATHGoogle Scholar
  3. 3.
    Kelley Jr., J.E.: Critical-path planning and scheduling: mathematical basis. Oper. Res. 9(3), 296–320 (1961). InformsMathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Kolisch, R., Sprecher, A.: PSPLIB - a project scheduling library. Eur. J. Oper. Res. 96(1), 205–216 (1997). ElsevierCrossRefzbMATHGoogle Scholar
  5. 5.
    Pesic, M., van der Aalst, W.M.P.: A declarative approach for flexible business processes management. In: Eder, J., Dustdar, S. (eds.) BPM 2006. LNCS, vol. 4103, pp. 169–180. Springer, Heidelberg (2006). Scholar
  6. 6.
    Mrasek, R., Mülle, J., Böhm, K.: Process synthesis with sequential and parallel constraints. In: Debruyne, C., et al. (eds.) On the Move to Meaningful Internet Systems, vol. 10033, pp. 43–60. Springer, Cham (2016). Scholar
  7. 7.
    Niederliński, A.: A Gentle Guide to Constraint Logic Programming via ECLiPSe, 3rd edn. Jacek Skalmierski Computer Studio, Gliwice (2014)Google Scholar
  8. 8.
    Schimpf, J., Shen, K.: ECLiPSe - from LP to CLP. Theor. Pract. Log. Program. 12(1–2), 127–156 (2012). Cambridge University PressCrossRefzbMATHGoogle Scholar
  9. 9.
    Sindelar, M., Sitaraman, R.K., Shenoy, P.: Sharing-aware algorithms for virtual machine colocation. In: Proceedings of 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 367–378. ACM (2011).
  10. 10.
    Ullman, J.D.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384–393 (1975). Academic PressMathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    The ECLiPSe Constraint Programming System. Accessed Mar 2019
  12. 12.
    Gecode - Generic Constraint Development Environment. Accessed Mar 2019
  13. 13.
    Project Scheduling Problem Library - PSPLIB. Accessed Mar 2019

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Amelia Bădică
    • 1
  • Costin Bădică
    • 1
    Email author
  • Doina Logofătu
    • 2
  • Ion Buligiu
    • 1
  • Liviu Ciora
    • 1
  1. 1.University of CraiovaCraiovaRomania
  2. 2.University of Applied SciencesFrankfurtGermany

Personalised recommendations