{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:06:23Z","timestamp":1742958383123,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031248405"},{"type":"electronic","value":"9783031248412"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-24841-2_6","type":"book-chapter","created":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:04:39Z","timestamp":1673222679000},"page":"85-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Flexible Job-shop Scheduling for\u00a0Semiconductor Manufacturing with\u00a0Hybrid Answer Set Programming (Application Paper)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4794-6560","authenticated-orcid":false,"given":"Ramsha","family":"Ali","sequence":"first","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8010-4752","authenticated-orcid":false,"given":"Martin","family":"Gebser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,8]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1017\/S1471068420000046","volume":"21","author":"D Abels","year":"2021","unstructured":"Abels, D., Jordi, J., Ostrowski, M., Schaub, T., Toletti, A., Wanko, P.: Train scheduling with hybrid answer set programming. Theory Pract. Logic Program. 21(3), 317\u2013347 (2021)","journal-title":"Theory Pract. Logic Program."},{"issue":"1","key":"6_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. Fundamenta Informaticae 147(1), 1\u201325 (2016)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR3","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":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-018-2757-7","volume":"275","author":"M Banbara","year":"2019","unstructured":"Banbara, M., et al.: teaspoon: solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. 275(1), 3\u201337 (2019)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"6_CR5","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)","journal-title":"Computing"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/s12351-020-00615-0","volume":"21","author":"Z Ceylan","year":"2021","unstructured":"Ceylan, Z., Tozan, H., Bulkan, S.: A coordinated scheduling problem for the supply chain in a flexible job shop machine environment. Oper. Res. 21(2), 875\u2013900 (2021). https:\/\/doi.org\/10.1007\/s12351-020-00615-0","journal-title":"Oper. Res."},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"I Chaudhry","year":"2015","unstructured":"Chaudhry, I., Khan, A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551\u2013591 (2015)","journal-title":"Int. Trans. Oper. Res."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-30048-7_9","volume-title":"Principles and Practice of Constraint Programming","author":"G Da Col","year":"2019","unstructured":"Da Col, G., Teppan, E.C.: Industrial size job shop scheduling tackled by present day CP solvers. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 144\u2013160. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_9"},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1017\/S1471068421000363","volume":"21","author":"C Dodaro","year":"2021","unstructured":"Dodaro, C., Galat\u00e0, G., Grioni, A., Maratea, M., Mochi, M., Porro, I.: An ASP-based solution to the chemotherapy treatment scheduling problem. Theory Pract. Logic Program. 21(6), 835\u2013851 (2021)","journal-title":"Theory Pract. Logic Program."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Eiter, T., Geibinger, T., Musliu, N., Oetsch, J., Skocovsk\u00fd, P., Stepanova, D.: Answer-set programming for lexicographical makespan optimisation in parallel machine scheduling. In: Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2021), pp. 280\u2013290. AAAI Press (2021)","DOI":"10.24963\/kr.2021\/27"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1017\/S1471068422000217","volume":"22","author":"MMS El-Kholany","year":"2022","unstructured":"El-Kholany, M.M.S., Gebser, M., Schekotihin, K.: Problem decomposition and multi-shot ASP solving for job-shop scheduling. Theory Pract. Logic Program. 22(4), 623\u2013639 (2022)","journal-title":"Theory Pract. Logic Program."},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-030-75775-5_21","volume-title":"Logics in Artificial Intelligence","author":"G Francescutto","year":"2021","unstructured":"Francescutto, G., Schekotihin, K., El-Kholany, M.M.S.: Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP. In: Faber, W., Friedrich, G., Gebser, M., Morak, M. (eds.) JELIA 2021. LNCS (LNAI), vol. 12678, pp. 313\u2013328. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75775-5_21"},{"key":"6_CR13","unstructured":"Gebser, M., et al.: Potassco user guide (2019). https:\/\/potassco.org"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.asoc.2016.08.019","volume":"49","author":"A Hassanzadeh","year":"2016","unstructured":"Hassanzadeh, A., Rasti-Barzoki, M., Khosroshahi, H.: Two new meta-heuristics for a bi-objective supply chain scheduling problem in flow-shop environment. Appl. Soft Comput. 49, 335\u2013351 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0925-5273(96)00068-0","volume":"48","author":"O Holthaus","year":"1997","unstructured":"Holthaus, O.: Efficient dispatching rules for scheduling in a job shop. Int. J. Prod. Econ. 48(1), 87\u2013105 (1997)","journal-title":"Int. J. Prod. Econ."},{"issue":"5\u20136","key":"6_CR16","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1017\/S1471068417000242","volume":"17","author":"T Janhunen","year":"2017","unstructured":"Janhunen, T., Kaminski, R., Ostrowski, M., Schaub, T., Schellhorn, S., Wanko, P.: Clingo goes linear constraints over reals and integers. Theory Pract. Logic Program. 17(5\u20136), 872\u2013888 (2017)","journal-title":"Theory Pract. Logic Program."},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/TSM.2020.3001933","volume":"33","author":"D Kopp","year":"2020","unstructured":"Kopp, D., Hassoun, M., Kalir, A., M\u00f6nch, L.: SMT2020\u2013a semiconductor manufacturing testbed. IEEE Trans. Semiconductor Manuf. 33(4), 522\u2013531 (2020)","journal-title":"IEEE Trans. Semiconductor Manuf."},{"key":"6_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24658-7","volume-title":"Answer Set Programming","author":"V Lifschitz","year":"2019","unstructured":"Lifschitz, V.: Answer Set Programming. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-24658-7"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S147106841100007X","volume":"12","author":"F Ricca","year":"2012","unstructured":"Ricca, F., et al.: Team-building with answer set programming in the Gioia-Tauro seaport. Theory Pract. Logic Program. 12(3), 361\u2013381 (2012)","journal-title":"Theory Pract. Logic Program."},{"issue":"3","key":"6_CR20","first-page":"72","volume":"10","author":"R Sahraeian","year":"2017","unstructured":"Sahraeian, R., Rohaninejad, M., Fadavi, M.: A new model for integrated lot sizing and scheduling in flexible job shop problem. J. Ind. Syst. Eng. 10(3), 72\u201391 (2017)","journal-title":"J. Ind. Syst. Eng."},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-75775-5_30","volume-title":"Logics in Artificial Intelligence","author":"P Tassel","year":"2021","unstructured":"Tassel, P., Rbaia, M.: A multi-shot ASP encoding for the aircraft routing and maintenance planning problem. In: Faber, W., Friedrich, G., Gebser, M., Morak, M. (eds.) JELIA 2021. LNCS (LNAI), vol. 12678, pp. 442\u2013457. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75775-5_30"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.procir.2018.03.212","volume":"72","author":"B Waschneck","year":"2018","unstructured":"Waschneck, B., et al.: Optimization of global production scheduling with deep reinforcement learning. Procedia CIRP 72, 1264\u20131269 (2018)","journal-title":"Procedia CIRP"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","volume":"10","author":"L Xing","year":"2010","unstructured":"Xing, L., Chen, Y., Wang, P., Zhao, Q., Xiong, J.: A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl. Soft Comput. 10(3), 888\u2013896 (2010)","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24841-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T14:08:29Z","timestamp":1673273309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24841-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031248405","9783031248412"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24841-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston , MA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl23.sigplan.org\/home\/PADL-2023","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","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":"15","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":"4","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":"42% - 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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}