# Solving a Flowshop Scheduling Problem with Answer Set Programming: Exploiting the Problem to Reduce the Number of Combinations

## TL;DR

This paper explores using Answer Set Programming to efficiently solve a complex flowshop scheduling problem in semiconductor manufacturing by reducing the combinatorial complexity through a novel range-based method.

## Contribution

It introduces a range-based approach within Answer Set Programming to effectively decrease the solution space for flowshop scheduling problems.

## Key findings

- Reduced the number of combinations in scheduling solutions
- Demonstrated the applicability of ASP in semiconductor manufacturing scheduling
- Improved solution efficiency for complex scheduling problems

## Abstract

Planning and scheduling have been a central theme of research in computer science. In particular, the simplicity of the theoretical approach of a no-wait flowshop scheduling problem does not allow to perceive the problem complexity at first sight. In this paper the applicability of the Answer Set Programming language is explored for the solution of the Automated Wet-etching scheduling problem in Semiconductor Manufacturing Systems. A method based in ranges is proposed in order to reduce the huge number of combinations.