{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:09:41Z","timestamp":1743037781702,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030410315"},{"type":"electronic","value":"9783030410322"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41032-2_55","type":"book-chapter","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T22:02:28Z","timestamp":1581631348000},"page":"484-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Modeling Block Structured Project Scheduling with Resource Constraints"],"prefix":"10.1007","author":[{"given":"Amelia","family":"B\u0103dic\u0103","sequence":"first","affiliation":[]},{"given":"Costin","family":"B\u0103dic\u0103","sequence":"additional","affiliation":[]},{"given":"Doina","family":"Logof\u0103tu","sequence":"additional","affiliation":[]},{"given":"Ion","family":"Buligiu","sequence":"additional","affiliation":[]},{"given":"Liviu","family":"Ciora","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,13]]},"reference":[{"key":"55_CR1","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-92007-8_16","volume-title":"Artificial Intelligence Applications and Innovations","author":"A B\u0103dic\u0103","year":"2018","unstructured":"B\u0103dic\u0103, A., B\u0103dic\u0103, C., D\u0103nciulescu, D., Logof\u0103tu, 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\u2013195. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92007-8_16"},{"key":"55_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"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)"},{"issue":"3","key":"55_CR3","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1287\/opre.9.3.296","volume":"9","author":"JE Kelley Jr","year":"1961","unstructured":"Kelley Jr., J.E.: Critical-path planning and scheduling: mathematical basis. Oper. Res. 9(3), 296\u2013320 (1961). https:\/\/doi.org\/10.1287\/opre.9.3.296. Informs","journal-title":"Oper. Res."},{"issue":"1","key":"55_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB - a project scheduling library. Eur. J. Oper. Res. 96(1), 205\u2013216 (1997). https:\/\/doi.org\/10.1016\/S0377-2217(96)00170-1. Elsevier","journal-title":"Eur. J. Oper. Res."},{"key":"55_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11837862_18","volume-title":"Business Process Management Workshops","author":"M Pesic","year":"2006","unstructured":"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\u2013180. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11837862_18"},{"key":"55_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-48472-3_3","volume-title":"On the Move to Meaningful Internet Systems","author":"R Mrasek","year":"2016","unstructured":"Mrasek, R., M\u00fclle, J., B\u00f6hm, 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\u201360. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48472-3_3"},{"key":"55_CR7","volume-title":"A Gentle Guide to Constraint Logic Programming via ECLiPSe","author":"A Niederli\u0144ski","year":"2014","unstructured":"Niederli\u0144ski, A.: A Gentle Guide to Constraint Logic Programming via ECLiPSe, 3rd edn. Jacek Skalmierski Computer Studio, Gliwice (2014)","edition":"3"},{"issue":"1\u20132","key":"55_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1017\/S1471068411000469","volume":"12","author":"J Schimpf","year":"2012","unstructured":"Schimpf, J., Shen, K.: ECLiPSe - from LP to CLP. Theor. Pract. Log. Program. 12(1\u20132), 127\u2013156 (2012). https:\/\/doi.org\/10.1017\/S1471068411000469. Cambridge University Press","journal-title":"Theor. Pract. Log. Program."},{"doi-asserted-by":"publisher","unstructured":"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\u2013378. ACM (2011). https:\/\/doi.org\/10.1145\/1989493.1989554","key":"55_CR9","DOI":"10.1145\/1989493.1989554"},{"issue":"3","key":"55_CR10","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman, J.D.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384\u2013393 (1975). https:\/\/doi.org\/10.1016\/S0022-0000(75)80008-0. Academic Press","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"The ECLiPSe Constraint Programming System. http:\/\/www.eclipseclp.org\/. Accessed Mar 2019","key":"55_CR11"},{"unstructured":"Gecode - Generic Constraint Development Environment. https:\/\/www.gecode.org\/. Accessed Mar 2019","key":"55_CR12"},{"unstructured":"Project Scheduling Problem Library - PSPLIB. http:\/\/www.om-db.wi.tum.de\/psplib\/. Accessed Mar 2019","key":"55_CR13"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41032-2_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:40:46Z","timestamp":1607532046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41032-2_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030410315","9783030410322"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41032-2_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LSSC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Large-Scale Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sozopol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lssc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/parallel.bas.bg\/Conferences\/SciCom19\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}