ML Anthology

Decomposition Methods for Solving Scheduling Problem Using Answer Set Programming

Mohammed M. S. El-Kholany
IJCAI 2022 pp. 5849-5850
doi:10.24963/IJCAI.2022/827 /ijcai/2022/elkholany2022ijcai-decomposition/

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.

PDF IJCAI Semantic Scholar

Cite

Text

El-Kholany. "Decomposition Methods for Solving Scheduling Problem Using Answer Set Programming." International Joint Conference on Artificial Intelligence, 2022. doi:10.24963/IJCAI.2022/827

Markdown

[El-Kholany. "Decomposition Methods for Solving Scheduling Problem Using Answer Set Programming." International Joint Conference on Artificial Intelligence, 2022.](https://mlanthology.org/ijcai/2022/elkholany2022ijcai-decomposition/) doi:10.24963/IJCAI.2022/827

BibTeX

@inproceedings{elkholany2022ijcai-decomposition,
  title     = {{Decomposition Methods for Solving Scheduling Problem Using Answer Set Programming}},
  author    = {El-Kholany, Mohammed M. S.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2022},
  pages     = {5849-5850},
  doi       = {10.24963/IJCAI.2022/827},
  url       = {https://mlanthology.org/ijcai/2022/elkholany2022ijcai-decomposition/}
}