Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Jarosław, Pempera"'
Publikováno v:
Archives of Control Sciences, Vol vol. 30, Iss No 4, Pp 653-666 (2020)
The article introduces an innovative approch for the inspection challenge that represents a generalization of the classical Traveling Salesman Problem. Its priciple idea is to visit continuous areas (circles) in a way, that minimizes travelled distan
Externí odkaz:
https://doaj.org/article/902cd3455fcc45d0ae386ef45c84120c
Publikováno v:
Archives of Control Sciences, Vol vol. 30, Iss No 3, Pp 411-435 (2020)
In this paper, a parallel multi-path variant of the well-known TSAB algorithm for the job shop scheduling problem is proposed. Coarse-grained parallelization method is employed, which allows for great scalability of the algorithm with accordance to G
Externí odkaz:
https://doaj.org/article/5414a5c2d78041449bb664eac4bd9c13
Autor:
Mieczysław Wodecki, Mariusz Uchroński, Czesław Smutnicki, Jerzy W. Rozenblit, Jarosław Pempera, Ryszard Klempous, Wojciech Bożejko
This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible. The main disadvantage of calculations on quantum computers is their non-determinism.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::52223eefc58c2b27f17acc14eeca5609
https://doi.org/10.36227/techrxiv.22677721.v2
https://doi.org/10.36227/techrxiv.22677721.v2
Publikováno v:
Neurocomputing. 452:435-442
The work concerns a new problem of minimizing production time of a set of tasks on machines while limiting the availability of machine operators. The problem is taken from practice, from a company producing subassemblies for the automotive industry.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e529bb39392040cb4c5e283392d21bb5
https://doi.org/10.1016/j.neucom.2020.01.121
https://doi.org/10.1016/j.neucom.2020.01.121
Publikováno v:
In Procedia Computer Science 2013 18:936-945
Publikováno v:
IFAC-PapersOnLine. 54:1081-1086
We deal with the problem of cyclic scheduling tasks in the distributed manufacturing system with factories having the flow shop layout. The optimization aim is to minimize the cycle time. We have proposed the proprietary model and introduced some spe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35634ad11ce85003eaa3624b9d238f34
https://doi.org/10.1016/j.ifacol.2021.08.203
https://doi.org/10.1016/j.ifacol.2021.08.203
Publikováno v:
IFAC-PapersOnLine. 53:10542-10549
The paper presents a method allowing to construct no-wait cyclical schedules for repetitive transport systems (e.g. the milk-run) servicing cyclic material supply loops in the production system using selected means of transport (e.g. AGVs). The trans
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba7a410e728b22b4d47d17ee987baf19
https://doi.org/10.1016/j.ifacol.2020.12.2802
https://doi.org/10.1016/j.ifacol.2020.12.2802
Publikováno v:
Computational Science – ICCS 2022 ISBN: 9783031087592
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17b960e7dec88f759dfa960a7bac7607
https://doi.org/10.1007/978-3-031-08760-8_15
https://doi.org/10.1007/978-3-031-08760-8_15
Publikováno v:
16th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2021) ISBN: 9783030878689
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::870a21e0efa1d900d416f966a0964250
https://doi.org/10.1007/978-3-030-87869-6_72
https://doi.org/10.1007/978-3-030-87869-6_72
Publikováno v:
16th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2021) ISBN: 9783030878689
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f0e6eb040b3618059ac9724ffda0741
https://doi.org/10.1007/978-3-030-87869-6_71
https://doi.org/10.1007/978-3-030-87869-6_71