{"type":"ScholarlyArticle","title":"Decomposition Methods for Solving Scheduling Problem Using Answer Set Programming","authors":[{"name":"Mohammed M. S. El-Kholany","slug":"mohammed-m-s-el-kholany","given":"Mohammed  M. S.","family":"El-Kholany","affiliation":"University of Klagenfurt Cairo University"}],"abstract":"This study proposes solving scheduling problems in industrial applications using the decomposition approach. The proposed model has been built using Multi-shot Answer Set Programming with Difference Logic. We tested our model with some benchmark instances and the results showed that our model is comparable to Constraint Programming to other heuristics in the literature.","doi":"10.24963/ijcai.2022/827","url":"https://ijcai.org/proceedings/2022/827","pdf":"https://ijcai.org/proceedings/2022/0827.pdf","markdown":"https://ijcai.org/proceedings/2022/827.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/827","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Doctoral Consortium","track":"Doctoral Consortium","number":827,"pages":{"first":5849,"last":5850},"keywords":["Knowledge Representation and Reasoning (KRR): General"],"videos":[],"references":[{"position":1,"raw":"[Abseher et al., 2016] Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub, and Stefan Woltran. Shift design with answer set programming. Fundamenta Infor- maticae, 147(1):1-25, 2016.","title":"Shift design with answer set programming","authors":"Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub, Stefan Woltran","year":"2016","venue":"Fundamenta Informaticae","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baker, 1974] Kenneth R Baker. Introduction to sequencing and scheduling. John Wiley & Sons, 1974.","title":"Introduction to sequencing and scheduling","authors":"R Kenneth, Baker","year":"1974","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Banbara et al., 2013] Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue, and Torsten Schaub. An- swer set programming as a modeling language for course timetabling. Theory and Practice of Logic Programming, 13(4-5):783-798, 2013.","title":"Answer set programming as a modeling language for course timetabling","authors":"Banbara","year":"2013","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Demirkol et al., 1998] Ebru Demirkol, Sanjay Mehta, and Reha Uzsoy. Benchmarks for shop scheduling problems. European Journal of Operational Research, 109(1):137- 141, 1998.","title":"Benchmarks for shop scheduling problems","authors":"Ebru Demirkol, Sanjay Mehta, Reha Uzsoy","year":"1998","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[El-Kholany et al., 2022] Mohammed El-Kholany, Kon- stantin Schekotihin, and Martin Gebser. Decomposition- based job-shop scheduling with constrained clustering. In International Symposium on Practical Aspects of Declarative Languages, pages 165-180. Springer, 2022.","title":"Mohammed El-Kholany, Konstantin Schekotihin, and Martin Gebser. Decompositionbased job-shop scheduling with constrained clustering","authors":"El-Kholany","year":"2022","venue":"International Symposium on Practical Aspects of Declarative Languages","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Gebser et al., 2016] Martin Gebser, Roland Kaminski, Ben- jamin Kaufmann, Max Ostrowski, Torsten Schaub, and Philipp Wanko. Theory solving made easy with clingo 5. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016), 2016.","title":"Theory solving made easy with clingo 5","authors":"Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub, Philipp Wanko","year":"2016","venue":"Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gebser et al., 2019] Martin Gebser, Roland Kaminski, Ben- jamin Kaufmann, and Torsten Schaub. Multi-shot asp solving with clingo. Theory and Practice of Logic Pro- gramming, 19(1):27-82, 2019.","title":"Multi-shot asp solving with clingo","authors":"Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub","year":"2019","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Kaminski et al., 2017] Roland Kaminski, Torsten Schaub, and Philipp Wanko. A tutorial on hybrid answer set solv- ing with clingo. Reasoning Web International Summer School, pages 167-203, 2017.","title":"A tutorial on hybrid answer set solving with clingo","authors":"Roland Kaminski, Torsten Schaub, Philipp Wanko","year":"2017","venue":"Reasoning Web International Summer School","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kopp et al., 2020] Denny Kopp, Michael Hassoun, Adar Kalir, and Lars Mönch. Smt2020-a semiconductor man- ufacturing testbed. IEEE Transactions on Semiconductor Manufacturing, 33(4):522-531, 2020.","title":"Smt2020-a semiconductor manufacturing testbed","authors":"Denny Kopp, Michael Hassoun, Adar Kalir, Lars Mönch","year":"2020","venue":"IEEE Transactions on Semiconductor Manufacturing","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Lifschitz, 2008] Vladimir Lifschitz. What is answer set pro- gramming? Proceedings of the Twenty-Third AAAI Con- ference on Artificial Intelligence, pages 1594-1597, 2008.","title":"What is answer set programming","authors":"Vladimir Lifschitz","year":"2008","venue":"Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Ovacik and Uzsoy, 2012] Irfan M Ovacik and Reha Uzsoy. Decomposition methods for complex factory scheduling problems. Springer Science & Business Media, 2012.","title":"Decomposition methods for complex factory scheduling problems","authors":"M Irfan, Reha Ovacik, Uzsoy","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Taillard, 1993] Eric Taillard. Benchmarks for basic schedul- ing problems. european journal of operational research, 64(2):278-285, 1993.","title":"Benchmarks for basic scheduling problems","authors":"Eric Taillard, Taillard","year":"1993","venue":"european journal of operational research","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Zhang and Wu, 2010] Rui Zhang and Cheng Wu. A hybrid approach to large-scale job shop scheduling. Applied in- telligence, 32(1):47-59, 2010.","title":"A hybrid approach to large-scale job shop scheduling","authors":"Rui Zhang, Cheng Wu","year":"2010","venue":"Applied intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}