Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Soo-Y. Chang"'
Autor:
Byung-In Kim1, Soo Y. Chang1 syc@postech.ac.kr, Junho Chang1, Yoontech Han1, Jeongin Koo1, Kyungkuk Lim1, Jaejoon Shin1, Sangwon Jeong1, Woolahm Kwak1
Publikováno v:
Production Planning & Control. Jun2011, Vol. 22 Issue 4, p389-402. 14p. 1 Color Photograph, 11 Diagrams, 3 Charts.
Publikováno v:
Asia-Pacific Journal of Operational Research. Mar2004, Vol. 21 Issue 1, p117-125. 9p.
Autor:
Soo Y. Chang, Woo-Lahm Kwak
Publikováno v:
Journal of Combinatorial Optimization. 27:597-608
We consider the batch production of hierarchical product lines in raw material industry where the whole or parts of multiple customer orders may be consolidated and processed in the same batch if their product specifications are compatible. The objec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b51314409735be01daa0a3669972c3b
https://doi.org/10.1007/s10878-012-9538-z
https://doi.org/10.1007/s10878-012-9538-z
Publikováno v:
Theoretical Computer Science. 412(39):5211-5224
We consider the online parallel machine scheduling problem of minimizing the makespan under eligibility constraints that restrict each job to be processed only on one of its eligible machines. The greedy approach known as AW is known to be optimal fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c80b81978ffd16e9f8e4b4c3b4325152
Publikováno v:
Networks. 58:12-19
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f78949a6271f5f4a59adc99844faaf28
https://doi.org/10.1002/net.20409
https://doi.org/10.1002/net.20409
Autor:
Sangwon Jeong, Byung-In Kim, Soo Y. Chang, Jaejoon Shin, Jeongin Koo, Yoontech Han, Woo-Lahm Kwak, Jun-Ho Chang, Kyungkuk Lim
Publikováno v:
Production Planning & Control. 22:389-402
Formulating a schedule for unloading raw material from ships at the seaport of a steelworks is a difficult task. Even in its simplest possible form, finding an optimum solution for the problem is nondeterministic polynomial time (NP)-hard. The proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8a3a61a80daef063bfa160a67647960
https://doi.org/10.1080/09537287.2010.488923
https://doi.org/10.1080/09537287.2010.488923
Publikováno v:
Journal of Engineering Education Research. 13:3-10
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c863ec47947ef174e8e7b46a4af2225b
https://doi.org/10.18108/jeer.2010.13.3.3
https://doi.org/10.18108/jeer.2010.13.3.3
Autor:
Wonsup Lee, You Heecheon, Jung， Kihyo, Chi-Hyuck Jun, Sung Ho Han, Soo Y. Chang, Joonho Chang, Jung Mooyoung
Publikováno v:
Journal of Engineering Education Research. 11:11-18
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a0d6f3964111ecd55f1be65921ad5a2
https://doi.org/10.18108/jeer.2008.11.4.11
https://doi.org/10.18108/jeer.2008.11.4.11
Autor:
Joonho Chang, Soo-Y. Chang, Jun-Ho Chang, Heecheon You, Chi-Hyuck Jun, Wonsup Lee, Kihyo Jung
Publikováno v:
Journal of Engineering Education Research. 11:5-11
Far greater than ever before is the present industrial demand for skilled professionals in innovative product design and development. Yet there is an apparent lack of a sufficient curricular provision for training design professionals in almost all e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9f6b7411d1821f169cf9db01caed342
https://doi.org/10.18108/jeer.2008.11.3.5
https://doi.org/10.18108/jeer.2008.11.3.5
Publikováno v:
Computers & Operations Research. 35:1292-1314
The NP-hard component set identification problem is a combinatorial problem arising in the context of knowledge discovery, information integration, and knowledge source/service composition. Considering a granular knowledge domain consisting of a larg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f26026c8517c19cfa5c6f1b7348a98fd
https://doi.org/10.1016/j.cor.2006.08.012
https://doi.org/10.1016/j.cor.2006.08.012