Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Erich Christian Teppan"'
Publikováno v:
KR
Optimal production planning in the form of job shop scheduling problems (JSSP) is a vital problem in many industries. In practice, however, it can happen that the volume of jobs (orders) exceeds the production capacity for a given planning horizon. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b402d7f5eb0f4e8a35d666c09b9e20b
https://doi.org/10.24963/kr.2021/72
https://doi.org/10.24963/kr.2021/72
Autor:
Giacomo Da Col, Erich Christian Teppan
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 306, Iss Proc. ICLP 2019, Pp 259-265 (2019)
The job-shop scheduling is one of the most studied optimization problems from the dawn of computer era to the present day. Its combinatorial nature makes it easily expressible as a constraint satisfaction problem. In this paper, we compare the perfor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b09f71d730d0e0168898de907cbe80d9
https://doi.org/10.4204/eptcs.306.30
https://doi.org/10.4204/eptcs.306.30
Autor:
Erich Christian Teppan, Giacomo Da Col
Publikováno v:
Advances in Integrations of Intelligent Methods ISBN: 9789811519178
Generating optimized large-scale production plans is an important open problem where even small improvements result in significant savings. Application scenarios in the semiconductor industry comprise thousands of machines and hundred thousands of jo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d6bf68ac6ce628c21fbfbf191e7d510
https://doi.org/10.1007/978-981-15-1918-5_7
https://doi.org/10.1007/978-981-15-1918-5_7
Autor:
Erich Christian Teppan, Markus Zanker
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030594909
ISMIS
ISMIS
The capability of a recommendation system to justify its proposals becomes an ever more important aspect in light of recent legislation and skeptic users. Answer Set Programming (ASP) is a logic programming paradigm aiming at expressing complex probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::396d0b00d06b3c2357510838c9611ac4
https://doi.org/10.1007/978-3-030-59491-6_37
https://doi.org/10.1007/978-3-030-59491-6_37
Autor:
Erich Christian Teppan
Publikováno v:
Artificial Intelligence. 248:112-122
The partner units problem is an acknowledged hard benchmark problem for the logic programming community with various industrial application fields like CCTV surveillance or railway safety systems. Whereas many complexity results exist for the optimiz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8032df7c3fe66f23635a5579ac53567
https://doi.org/10.1016/j.artint.2017.04.002
https://doi.org/10.1016/j.artint.2017.04.002
Autor:
Erich Christian Teppan, Giacomo Da Col
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030300470
CP
CP
The job shop scheduling problem (JSSP) is an abstraction of industrial scheduling and has been studied since the dawn of the computer era. Its combinatorial nature makes it easily expressible as a constraint satisfaction problem. Nevertheless, in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::228c91eed876e970c594970c1d68489e
https://doi.org/10.1007/978-3-030-30048-7_9
https://doi.org/10.1007/978-3-030-30048-7_9
Publikováno v:
Journal of Computer and System Sciences. 82:739-755
The partner units problem (PUP) is an acknowledged hard benchmark problem for the Logic Programming community with various industrial application fields like surveillance, electrical engineering, computer networks or railway safety systems. Although
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7782ab23316da31c8503de02771a5d8b
https://doi.org/10.1016/j.jcss.2015.12.004
https://doi.org/10.1016/j.jcss.2015.12.004
Autor:
Erich Christian Teppan
Publikováno v:
SSCI
Generating optimized large-scale production plans is an important open problem where even small improvements result in significant savings. Application scenarios in the semiconductor industry comprise thousands of machines and hundred thousands of jo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::455d8f9873516a07202ca477b81c4546
https://doi.org/10.1109/ssci.2018.8628827
https://doi.org/10.1109/ssci.2018.8628827
Autor:
Markus Zanker, Erich Christian Teppan
Publikováno v:
Journal of Internet Commerce. 14:255-275
Recommender systems support online consumers in identifying suitable products from vast and complex product assortments. Typically, recommender systems compute choice sets of the top-k ranked products. Based on the actual user choices, the system tun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73078265f4e1a27e1128a26718caec79
https://doi.org/10.1080/15332861.2015.1018703
https://doi.org/10.1080/15332861.2015.1018703
Publikováno v:
Advances in Hybridization of Intelligent Methods ISBN: 9783319667898
Constraint answer set programming (CASP) is a family of hybrid approaches integrating answer set programming (ASP) and constraint programming (CP). These hybrid approaches have already proven to be successful in various domains. In this paper we pres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bdd778c6c344510de2d39b25ec472251
https://doi.org/10.1007/978-3-319-66790-4_7
https://doi.org/10.1007/978-3-319-66790-4_7