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

Carmen Leticia García-Mata
(Tecnológico Nacional de México - Tecnológico de Chihuahua)
Pedro Rafael Márquez-Gutiérrez
(Tecnológico Nacional de México - Tecnológico de Chihuahua)

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.

In Bart Bogaerts, Esra Erdem, Paul Fodor, Andrea Formisano, Giovambattista Ianni, Daniela Inclezan, German Vidal, Alicia Villanueva, Marina De Vos and Fangkai Yang: Proceedings 35th International Conference on Logic Programming (Technical Communications) (ICLP 2019), Las Cruces, NM, USA, September 20-25, 2019, Electronic Proceedings in Theoretical Computer Science 306, pp. 347–353.
Published: 19th September 2019.

ArXived at: https://dx.doi.org/10.4204/EPTCS.306.41 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org