default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJu-Yong Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j9]Ikjong Bae, Ju-Yong Lee, Hyunbeom Lee, Wansik Kim, Jaesub Han, Ki Chul Kim
, Jong-Min Yook:
Packaging of W-Band Power Amplifier Modules Using Waveguide-Microstrip Line Transition Feeds and High-Isolation Power Combiners. IEEE Access 14: 61441-61451 (2026)- 2025
- [j8]Ju-Yong Lee, Jein Yu, Wansik Kim, Jong-Min Yook:
Antenna-in-Package Using IC-Embedded Metal Fan-Out Wafer-Level Package for D-Band Applications. IEEE Access 13: 107736-107744 (2025) - [j7]Ju-Yong Lee, Ik-Cheol Jeon, Jun-Hee Han:
Scheduling for two stages with a single machine and a job shop. Comput. Oper. Res. 183: 107167 (2025) - 2023
- [i1]Min-Ha Oh, Young-Hwan Kim, Seung-Min Lee, Gyeong-Seok Hwang, Kyung-Sub Kim, Jae-Young Bae, Ju-Young Kim, Ju-Yong Lee, Yu-Chan Kim, Sang Yup Kim, Seung-Kyun Kang:
Lifetime-configurable soft robots via photodegradable silicone elastomer composites. CoRR abs/2302.14331 (2023) - 2021
- [j6]BongJoo Jeong, Jun-Hee Han, Ju-Yong Lee:
Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times. Algorithms 14(11): 323 (2021)
2010 – 2019
- 2019
- [j5]Jun-Hee Han, Ju-Yong Lee, Yeong-Dae Kim:
Production planning in a two-level supply chain for production-time-dependent products with dynamic demands. Comput. Ind. Eng. 135: 1-9 (2019) - 2017
- [j4]Ju-Yong Lee, Yeong-Dae Kim:
Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine. Comput. Ind. Eng. 114: 22-30 (2017) - 2015
- [j3]Ju-Yong Lee, Yeong-Dae Kim:
A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint. J. Oper. Res. Soc. 66(9): 1542-1554 (2015) - 2014
- [j2]Du-Hyun Han, Yeong-Dae Kim, Ju-Yong Lee:
Multiple-criterion shortest path algorithms for global path planning of unmanned combat vehicles. Comput. Ind. Eng. 71: 57-69 (2014) - 2012
- [j1]Ju-Yong Lee, Yeong-Dae Kim:
Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance. Comput. Oper. Res. 39(9): 2196-2205 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-05-06 00:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
