default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYeong-Dae Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j50]BongJoo Jeong
, Yeong-Dae Kim, Sang-Oh Shim:
Algorithms for a two-machine flowshop problem with jobs of two classes. Int. Trans. Oper. Res. 27(6): 3123-3143 (2020)- 2019
- [j49]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
- [j48]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) - 2016
- [j47]Jun-Hee Han, Yeong-Dae Kim:
Design and operation of a two-level supply chain for production-time-dependent products using Lagrangian relaxation. Comput. Ind. Eng. 96: 118-125 (2016) - [j46]Young-Jin An, Yeong-Dae Kim, Seong-Woo Choi:
Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times. Comput. Oper. Res. 71: 127-136 (2016) - 2015
- [j45]Kyung-Yeol Bae, Yeong-Dae Kim, Jun-Hee Han:
Finding a risk-constrained shortest path for an unmanned combat vehicle. Comput. Ind. Eng. 80: 245-253 (2015) - [j44]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
- [j43]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) - [j42]BongJoo Jeong, Yeong-Dae Kim:
Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times. Comput. Oper. Res. 47: 72-80 (2014) - 2013
- [j41]Dong-Guen Kim, Yeong-Dae Kim:
A Lagrangian heuristic algorithm for a public healthcare facility location problem. Ann. Oper. Res. 206(1): 221-240 (2013) - 2012
- [j40]Chul-Hwan Park, Yeong-Dae Kim, BongJoo Jeong:
Heuristics for determining a patrol path of an unmanned combat vehicle. Comput. Ind. Eng. 63(1): 150-160 (2012) - [j39]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) - [j38]Young-Jin An, Yeong-Dae Kim, BongJoo Jeong, S.-D. Kim:
Scheduling healthcare services in a home healthcare system. J. Oper. Res. Soc. 63(11): 1589-1599 (2012) - 2011
- [j37]Bong-Kyun Kim, Yeong-Dae Kim:
Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit. Comput. Ind. Eng. 61(4): 1309-1317 (2011) - [j36]June-Young Bang, Yeong-Dae Kim:
Scheduling algorithms for a semiconductor probing facility. Comput. Oper. Res. 38(3): 666-673 (2011) - 2010
- [j35]Dong-Guen Kim, Yeong-Dae Kim:
A branch and bound algorithm for determining locations of long-term care facilities. Eur. J. Oper. Res. 206(1): 168-177 (2010) - [j34]June-Young Bang, Yeong-Dae Kim:
Hierarchical Production Planning for Semiconductor Wafer Fabrication Based on Linear Programming and Discrete-Event Simulation. IEEE Trans Autom. Sci. Eng. 7(2): 326-336 (2010) - 2009
- [j33]Seong-Woo Choi, Yeong-Dae Kim:
Minimizing total tardiness on a two-machine re-entrant flowshop. Eur. J. Oper. Res. 199(2): 375-384 (2009) - [j32]Yeong-Dae Kim, Byung-Jun Joo, Jong-Ho Shin:
Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. J. Heuristics 15(1): 19-42 (2009) - [j31]Byung-Jun Joo, Yeong-Dae Kim:
A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints. J. Oper. Res. Soc. 60(4): 572-582 (2009) - 2008
- [j30]Ho-Joo Lee, Yeong-Dae Kim, Sang-Beom Lee:
A simulation-based heuristic algorithm for disposition of direction finders. Comput. Ind. Eng. 55(1): 134-149 (2008) - [j29]Sang-Oh Shim, Yeong-Dae Kim:
A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property. Comput. Oper. Res. 35(3): 863-875 (2008) - [j28]Seong-Woo Choi, Yeong-Dae Kim:
Minimizing makespan on an m-machine re-entrant flowshop. Comput. Oper. Res. 35(5): 1684-1696 (2008) - [j27]Truong Ton Hien Duc, Huynh Trung Luong, Yeong-Dae Kim:
A measure of bullwhip effect in supply chains with a mixed autoregressive-moving average demand process. Eur. J. Oper. Res. 187(1): 243-256 (2008) - 2007
- [j26]Ho-Joo Lee, Yeong-Dae Kim:
Heuristics for search sequencing under time-dependent probabilities of existence. Comput. Oper. Res. 34(7): 2010-2024 (2007) - [j25]Sang-Oh Shim, Yeong-Dae Kim:
Scheduling on parallel identical machines to minimize total tardiness. Eur. J. Oper. Res. 177(1): 135-146 (2007) - [j24]Sang-Oh Shim, Yeong-Dae Kim:
Minimizing total tardiness in an unrelated parallel-machine scheduling problem. J. Oper. Res. Soc. 58(3): 346-354 (2007) - [j23]S.-W. Choi, Yeong-Dae Kim:
Minimizing makespan on a two-machine re-entrant flowshop. J. Oper. Res. Soc. 58(7): 972-981 (2007) - 2005
- [j22]Hwa-Joong Kim, Yeong-Dae Kim, Dong-Ho Lee:
Scheduling for an arc-welding robot considering heat-caused distortion. J. Oper. Res. Soc. 56(1): 39-50 (2005) - 2004
- [j21]Seong-Hoon Choi, Yeong-Dae Kim:
Reallocation of paths of ABR services in a multistage interconnection network (MIN)-type ATM switch network. Eur. J. Oper. Res. 159(1): 207-218 (2004) - 2003
- [j20]Geun-Cheol Lee, Yeong-Dae Kim, J.-G. Kim, S.-H. Choi:
A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system. J. Oper. Res. Soc. 54(10): 1038-1049 (2003) - [j19]Jae-Gon Kim, Yeong-Dae Kim:
A linear programming-based algorithm for floorplanning in VLSI design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(5): 584-592 (2003) - 2002
- [j18]J.-G. Kang, Yeong-Dae Kim:
Stowage planning in maritime container transportation. J. Oper. Res. Soc. 53(4): 415-426 (2002) - [j17]S.-H. Choi, Yeong-Dae Kim:
A traffic control algorithm for Clos network type ATM switches. J. Oper. Res. Soc. 53(7): 783-791 (2002) - [j16]Jung-Ug Kim, Yeong-Dae Kim, Sang-Oh Shim:
Heuristic algorithms for a multi-period multi-stop transportation planning problem. J. Oper. Res. Soc. 53(9): 1027-1037 (2002) - 2001
- [j15]Yeong-Dae Kim, Dong-Ho Lee, Chi-Moon Yoon:
Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems. Eur. J. Oper. Res. 133(3): 624-634 (2001) - [j14]S.-K. Lim, Yeong-Dae Kim:
Plant location and procurement planning in knockdown production systems. J. Oper. Res. Soc. 52(3): 271-282 (2001) - [j13]Yeong-Dae Kim, Jae-Gon Kim, Bum Choi, Hyung-Un Kim:
Production scheduling in a semiconductor wafer fabrication facility producing multiple product types with distinct due dates. IEEE Trans. Robotics Autom. 17(5): 589-598 (2001) - [j12]Yeong-Dae Kim, Geun-Cheol Lee, Seong-Kook Choi, Seung-Kil Lim:
Tool requirements planning in a flexible manufacturing system with an automatic tool transporter. IEEE Trans. Robotics Autom. 17(6): 795-804 (2001) - 2000
- [j11]Moon-Won Park, Yeong-Dae Kim:
A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints. Eur. J. Oper. Res. 123(3): 504-518 (2000) - [j10]Jung-Ug Kim, Yeong-Dae Kim:
A Lagrangian relaxation approach to multi-period inventory/distribution planning. J. Oper. Res. Soc. 51(3): 364-370 (2000) - 1999
- [j9]M.-W. Park, Yeong-Dae Kim:
A heuristic algorithm for a production planning problem in an assembly system. J. Oper. Res. Soc. 50(2): 138-147 (1999) - [j8]J.-G. Kim, Yeong-Dae Kim:
A branch and bound algorithm for locating input and output points of departments on the block layout. J. Oper. Res. Soc. 50(5): 517-525 (1999) - [j7]S.-K. Lim, Yeong-Dae Kim:
An integrated approach to dynamic plant location and capacity planning. J. Oper. Res. Soc. 50(12): 1205-1216 (1999) - [j6]Hong-Bae Jun, Yeong-Dae Kim, Hyo-Won Suh:
Heuristics for a tool provisioning problem in a flexible manufacturing system with an automatic tool transporter. IEEE Trans. Robotics Autom. 15(3): 488-496 (1999) - 1998
- [j5]Moon-Won Park, Yeong-Dae Kim:
A systematic procedure for setting parameters in simulated annealing algorithms. Comput. Oper. Res. 25(3): 207-217 (1998) - [j4]Dong-Ho Lee, Yeong-Dae Kim:
A multi-period order selection problem in flexible manufacturing systems. J. Oper. Res. Soc. 49(3): 278-286 (1998) - 1996
- [j3]Jung-Ug Kim, Yeong-Dae Kim:
Simulated annealing and genetic algorithms for scheduling products with multi-level product structure. Comput. Oper. Res. 23(9): 857-868 (1996) - 1995
- [j2]Yeong-Dae Kim:
A backward approach in list scheduling algorithms for multi-machine tardiness problems. Comput. Oper. Res. 22(3): 307-319 (1995) - 1993
- [j1]Yeong-Dae Kim:
A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Comput. Oper. Res. 20(4): 391-401 (1993)
Conference and Workshop Papers
- 2008
- [c1]June-Young Bang, Jae-Hun Kang, Bong-Kyun Kim, Yeong-Dae Kim:
Multi-product lot merging/splitting algorithms for a semiconductor wafer fabrication. WSC 2008: 2209-2215
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-10-02 21:39 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
