Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Chengran Lin"'
Publikováno v:
IEEE Transactions on Automation Science and Engineering. 20:936-949
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a83411be6bbf3061437e055c2d71f877
https://doi.org/10.1109/tase.2022.3178126
https://doi.org/10.1109/tase.2022.3178126
Publikováno v:
IEEE Robotics & Automation Magazine. :2-13
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::526ca5e0431345b50f55333cc6eca3bc
https://doi.org/10.1109/mra.2023.3265515
https://doi.org/10.1109/mra.2023.3265515
Publikováno v:
IEEE Transactions on Automation Science and Engineering. :1-11
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3ac605447d2836aa027aac1d4684ff7
https://doi.org/10.1109/tase.2023.3267714
https://doi.org/10.1109/tase.2023.3267714
Publikováno v:
IEEE Transactions on Automation Science and Engineering. 19:3659-3671
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::946b8c401fdb7b77bcb6e2ae109d70f5
https://doi.org/10.1109/tase.2021.3129439
https://doi.org/10.1109/tase.2021.3129439
Publikováno v:
IEEE transactions on cybernetics.
This work considers an extended version of flexible job-shop problem from a postprinting or semiconductor manufacturing environment, which needs a directed acyclic graph rather than a linear order to describe the precedences among operations. To obta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68b50574e76a75f9f7672f5982dc78eb
https://pubmed.ncbi.nlm.nih.gov/36355723
https://pubmed.ncbi.nlm.nih.gov/36355723
Publikováno v:
2022 IEEE 18th International Conference on Automation Science and Engineering (CASE).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1d0929fc53707d0eb01d0af703bd0b8
https://doi.org/10.1109/case49997.2022.9926486
https://doi.org/10.1109/case49997.2022.9926486
Publikováno v:
IEEE Transactions on Automation Science and Engineering. 18:56-69
Scheduling of complex manufacturing systems entails complicated constraints such as the mating operational one. Focusing on the real settings, this article considers an extended version of a flexible job shop problem that allows the precedence betwee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e579efb7374b00ace00e7ab04bc893d
https://doi.org/10.1109/tase.2019.2945717
https://doi.org/10.1109/tase.2019.2945717
Publikováno v:
IEEE/ASME Transactions on Mechatronics. 25:2155-2166
Parallel batch processor scheduling with dynamic job arrival is complex and challenging in semiconductor manufacturing. In order to get its reliable and high-performance schedule in a reasonable time, this work decomposes this scheduling problem into
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eac81c7f734dfe64a4e2833b7e47bc11
https://doi.org/10.1109/tmech.2020.2996911
https://doi.org/10.1109/tmech.2020.2996911
Publikováno v:
Journal of Industrial Information Integration. 31:100414
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7be3d67c84593f887164ba1204383f4
https://doi.org/10.1016/j.jii.2022.100414
https://doi.org/10.1016/j.jii.2022.100414
Publikováno v:
IEEE Transactions on Automation Science and Engineering. 16:825-837
A semiconductor final testing scheduling problem with multiresource constraints is considered in this paper, which is proved to be NP-hard. To minimize the makespan for this scheduling problem, a cuckoo search algorithm with reinforcement learning (R
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::862485bb1ad55d804345e30fb779f8f0
https://doi.org/10.1109/tase.2018.2862380
https://doi.org/10.1109/tase.2018.2862380