Academic Journal
Solving a Flowshop Scheduling Problem with Answer Set Programming: Exploiting the Problem to Reduce the Number of Combinations
| العنوان: | Solving a Flowshop Scheduling Problem with Answer Set Programming: Exploiting the Problem to Reduce the Number of Combinations |
|---|---|
| المؤلفون: | Carmen Leticia García-Mata, Pedro Rafael Márquez-Gutiérrez |
| المصدر: | Electronic Proceedings in Theoretical Computer Science, Vol 306, Iss Proc. ICLP 2019, Pp 347-353 (2019) |
| بيانات النشر: | Open Publishing Association |
| سنة النشر: | 2019 |
| المجموعة: | Directory of Open Access Journals: DOAJ Articles |
| مصطلحات موضوعية: | Mathematics, QA1-939, Electronic computers. Computer science, QA75.5-76.95 |
| الوصف: | 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. |
| نوع الوثيقة: | article in journal/newspaper |
| اللغة: | English |
| تدمد: | 2075-2180 |
| Relation: | http://arxiv.org/pdf/1908.00183v2; https://doaj.org/toc/2075-2180; https://doaj.org/article/7c935b619b3a419b9e7270dfa59043ca |
| DOI: | 10.4204/EPTCS.306.41 |
| الاتاحة: | https://doi.org/10.4204/EPTCS.306.41 https://doaj.org/article/7c935b619b3a419b9e7270dfa59043ca |
| رقم الانضمام: | edsbas.6134C437 |
| قاعدة البيانات: | BASE |
Full Text Finder | تدمد: | 20752180 |
|---|---|
| DOI: | 10.4204/EPTCS.306.41 |