2019/08/31 by Carmen Leticia García-Mata, Pedro Rafael Márquez-Gutiérrez
Computer Science · #cs.AI #cs.LO
paper · pdf · doi:10.4204/eptcs.306.41
published as EPTCS 306, 2019, pp. 347-353 · In Proceedings ICLP 2019, arXiv:1909.07646
arxiv created 2019/09/19 · arxiv updated 2019/09/20
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.