default search action
Jin Young Choi 0003
Person information
- affiliation: Ajou University, Department of Industrial Engineering, South Korea
Other persons with the same name
- Jin Young Choi (aka: Jin-Young Choi) — disambiguation page
- Jin Young Choi 0001 — Digital Communications Infra Division, Samsung Networks, Korea
- Jin Young Choi 0002 — Seoul National University, Automation and Systems Research Institute, Department of Electrical and Computer Engineering, South Korea
- Jin Young Choi 0004 (aka: Jin-Young Choi 0004) — Dong-A University, Department of of Electronics, Busan, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Do Gyun Kim, Jin Young Choi:
Efficient imputation of missing data using the information of local space defined by the geometric one-class classifier. Expert Syst. Appl. 242: 122775 (2024) - 2022
- [j9]Yong Jin Suh, Jin Young Choi:
Efficient Fab facility layout with spine structure using genetic algorithm under various material-handling considerations. Int. J. Prod. Res. 60(9): 2816-2829 (2022)
2010 – 2019
- 2019
- [j8]Inkyo Jeong, Do Gyun Kim, Jin Young Choi, Jeonghan Ko:
Geometric one-class classifiers using hyper-rectangles for knowledge extraction. Expert Syst. Appl. 117: 112-124 (2019) - [c3]Do Gyun Kim, Jin Young Choi:
Efficient Imputation Method for Missing Data Focusing on Local Space Formed by Hyper-Rectangle Descriptors. ICORES 2019: 467-472 - [c2]Do Gyun Kim, Jin Young Choi:
Suggestion of Density-based Geometric One-Class Classifier using Genetic Algorithm. ICDM (Posters) 2019: 67-79 - 2017
- [j7]Hwang Ho Kim, Do Gyun Kim, Jin Young Choi, Sang Chul Park:
Tire mixing process scheduling using particle swarm optimization. Comput. Ind. Eng. 110: 333-343 (2017) - 2016
- [j6]Sung-Seok Ko, Yong-Hee Han, Jin Young Choi:
Paint batching problem on M-to-1 conveyor systems. Comput. Oper. Res. 74: 118-126 (2016) - 2015
- [j5]Jin Young Choi:
Minimizing total weighted completion time under makespan constraint for two-agent scheduling with job-dependent aging effects. Comput. Ind. Eng. 83: 237-243 (2015) - [j4]Hwang Ho Kim, Jin Young Choi:
Pattern generation for multi-class LAD using iterative genetic algorithm with flexible chromosomes and multiple populations. Expert Syst. Appl. 42(2): 833-843 (2015) - [j3]Hwang Ho Kim, Jin Young Choi:
Hierarchical multi-class LAD based on OvA-binary tree using genetic algorithm. Expert Syst. Appl. 42(21): 8134-8145 (2015) - 2012
- [c1]Hwang Ho Kim, Moon Kyung Kim, Jin Young Choi, Gi-Nam Wang:
Design and application of data interchange formats (DIFs) for improving interoperability in SBA. WSC 2012: 328:1-328:2 - 2011
- [j2]Sung-Seok Ko, Jin Young Choi, Dong-Won Seo:
Approximations of lead-time distributions in an assemble-to-order system under a base-stock policy. Comput. Oper. Res. 38(2): 582-590 (2011)
2000 – 2009
- 2009
- [j1]Jin Young Choi, Sung-Seok Ko:
Simulation-based two-phase genetic algorithm for the capacitated re-entrant line scheduling problem. Comput. Ind. Eng. 57(3): 660-666 (2009)
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 2024-11-22 20:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint