{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:21:33Z","timestamp":1775053293114,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030757748","type":"print"},{"value":"9783030757755","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75775-5_21","type":"book-chapter","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T23:46:09Z","timestamp":1620776769000},"page":"313-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Solving a Multi-resource Partial-Ordering Flexible Variant of the Job-Shop Scheduling Problem with Hybrid ASP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4925-3346","authenticated-orcid":false,"given":"Giulia","family":"Francescutto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0286-0958","authenticated-orcid":false,"given":"Konstantin","family":"Schekotihin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1088-2081","authenticated-orcid":false,"given":"Mohammed M. S.","family":"El-Kholany","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,12]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Abels, D., Jordi, J., Ostrowski, M., Schaub, T., Toletti, A., Wanko, P.: Train scheduling with hybrid ASP. In: LPNMR, pp. 3\u201317 (2019)","DOI":"10.1007\/978-3-030-20528-7_1"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2016-1396","volume":"147","author":"M Abseher","year":"2016","unstructured":"Abseher, M., Gebser, M., Musliu, N., Schaub, T., Woltran, S.: Shift design with answer set programming. FI 147(1), 1\u201325 (2016)","journal-title":"FI"},{"key":"21_CR3","unstructured":"Balduccini, M.: Representing constraint satisfaction problems in answer set programming. In: ASPOCP, pp. 16\u201330 (2009)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-20895-9_33","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Balduccini","year":"2011","unstructured":"Balduccini, M.: Industrial-size scheduling with ASP+CP. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 284\u2013296. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20895-9_33"},{"issue":"4","key":"21_CR5","first-page":"408","volume":"17","author":"M Banbara","year":"2017","unstructured":"Banbara, M., Kaufmann, B., Ostrowski, M., Schaub, T.: Clingcon: the next generation. TPLP 17(4), 408\u2013461 (2017)","journal-title":"TPLP"},{"issue":"4\u20135","key":"21_CR6","first-page":"783","volume":"13","author":"M Banbara","year":"2013","unstructured":"Banbara, M., Soh, T., Tamura, N., Inoue, K., Schaub, T.: Answer set programming as a modeling language for course timetabling. TPLP 13(4\u20135), 783\u2013798 (2013)","journal-title":"TPLP"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10288-007-0038-4","volume":"6","author":"O Bellenguez-Morineau","year":"2008","unstructured":"Bellenguez-Morineau, O.: Methods to solve multi-skill project scheduling problem. 4OR 6(1), 85\u201388 (2008). https:\/\/doi.org\/10.1007\/s10288-007-0038-4","journal-title":"4OR"},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369\u2013375 (1990). https:\/\/doi.org\/10.1007\/BF02238804","journal-title":"Computing"},{"issue":"2","key":"21_CR9","first-page":"294","volume":"20","author":"F Calimeri","year":"2020","unstructured":"Calimeri, F., et al.: ASP-Core-2 input language format. TPLP 20(2), 294\u2013309 (2020)","journal-title":"TPLP"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0377-2217(97)00341-X","volume":"107","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1998","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Roux, W., Lasserre, J.: Multi-resource shop scheduling with resource flexibility. EJOR 107(2), 289\u2013305 (1998)","journal-title":"EJOR"},{"key":"21_CR11","unstructured":"Dodaro, C., Galat\u00e0, G., Maratea, M., Mochi, M., Porro, I.: Chemotherapy treatment scheduling via answer set programming. In: CILC, pp. 342\u2013356 (2020)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-31095-0_5","volume-title":"Rules and Reasoning","author":"C Dodaro","year":"2019","unstructured":"Dodaro, C., Galat\u00e0, G., Khan, M.K., Maratea, M., Porro, I.: An ASP-based solution for operating room scheduling with beds management. In: Fodor, P., Montali, M., Calvanese, D., Roman, D. (eds.) RuleML+RR 2019. LNCS, vol. 11784, pp. 67\u201381. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31095-0_5"},{"issue":"4","key":"21_CR13","first-page":"543","volume":"89","author":"N E\u00e9n","year":"2003","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Temporal induction by incremental SAT solving. ENTCS 89(4), 543\u2013560 (2003)","journal-title":"ENTCS"},{"key":"21_CR14","first-page":"1","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-boolean constraints into SAT. JSAT 2, 1\u201326 (2006)","journal-title":"JSAT"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Friedrich, G., et al.: Representing production scheduling with constraint answer set programming. In: OR, pp. 159\u2013165 (2014)","DOI":"10.1007\/978-3-319-28697-6_23"},{"key":"21_CR16","unstructured":"Gebser, M., et al.: Potassco user guide (2019). http:\/\/potassco.org"},{"key":"21_CR17","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: ICLP (Technical Communications), pp. 2:1\u20132:15 (2016)"},{"issue":"1","key":"21_CR18","first-page":"27","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. TPLP 19(1), 27\u201382 (2019)","journal-title":"TPLP"},{"key":"21_CR19","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP\/SLP, pp. 1070\u20131080 (1988)"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. EJOR 207(1), 1\u201314 (2010)","journal-title":"EJOR"},{"issue":"5\u20136","key":"21_CR21","first-page":"872","volume":"17","author":"T Janhunen","year":"2017","unstructured":"Janhunen, T., Kaminski, R., Ostrowski, M., Schellhorn, S., Wanko, P., Schaub, T.: Clingo goes linear constraints over reals and integers. TPLP 17(5\u20136), 872\u2013888 (2017)","journal-title":"TPLP"},{"issue":"1","key":"21_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S Johnson","year":"1954","unstructured":"Johnson, S.: Optimal two-and three-stage production schedules with setup times included. NRLQ 1(1), 61\u201368 (1954)","journal-title":"NRLQ"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-030-05998-9_3","volume-title":"Practical Aspects of Declarative Languages","author":"MK Kahraman","year":"2019","unstructured":"Kahraman, M.K., Erdem, E.: Personalized course schedule planning using answer set programming. In: Alferes, J.J., Johansson, M. (eds.) PADL 2019. LNCS, vol. 11372, pp. 37\u201345. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05998-9_3"},{"key":"21_CR24","doi-asserted-by":"publisher","unstructured":"Lifschitz, V.: Answer Set Programming. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-24658-7","DOI":"10.1007\/978-3-030-24658-7"},{"issue":"3","key":"21_CR25","first-page":"361","volume":"12","author":"F Ricca","year":"2012","unstructured":"Ricca, F., et al.: Team-building with answer set programming in the Gioia-Tauro seaport. TPLP 12(3), 361\u2013381 (2012)","journal-title":"TPLP"},{"issue":"12\u201313","key":"21_CR26","first-page":"1031","volume":"170","author":"J Rintanen","year":"2006","unstructured":"Rintanen, J., Heljanko, K., Niemel\u00e4, I.: Planning as satisfiability: parallel plans and algorithms for plan search. AIJ 170(12\u201313), 1031\u20131080 (2006)","journal-title":"AIJ"},{"key":"21_CR27","unstructured":"Ross, R. (ed.): Microelectronics Failure Analysis: Desk Reference. ASM International, Russell (2011)"},{"issue":"3","key":"21_CR28","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01545587","volume":"19","author":"A Sprecher","year":"1997","unstructured":"Sprecher, A., Hartmann, S., Drexl, A.: An exact algorithm for project scheduling with multiple modes. OR Spectrum 19(3), 195\u2013203 (1997). https:\/\/doi.org\/10.1007\/BF01545587","journal-title":"OR Spectrum"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Teppan, E., Friedrich, G.: Heuristic constraint answer set programming for manufacturing problems. In: Advances in Hybridization of Intelligent Methods, pp. 119\u2013147 (2018)","DOI":"10.1007\/978-3-319-66790-4_7"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75775-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T23:51:36Z","timestamp":1620777096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75775-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030757748","9783030757755"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75775-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"12 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jelia2021.aau.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}