  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.
