Decomposition Methods for Solving Scheduling Problem Using Answer Set Programming

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.