{"id":82,"date":"2021-04-01T21:41:16","date_gmt":"2021-04-01T12:41:16","guid":{"rendered":"https:\/\/chaos1.postech.ac.kr\/?page_id=82"},"modified":"2021-04-01T23:38:36","modified_gmt":"2021-04-01T14:38:36","slug":"publications","status":"publish","type":"page","link":"https:\/\/chaos1.postech.ac.kr\/index.php\/research\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"\n<p>To be updated<\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4>International Journal Articles<\/h4>\n\n\n\n<p><\/p>\n\n\n\n<ul><li><strong>Woo-Lahm Kwak<\/strong>\u00a0and\u00a0<strong>Soo Y. Chang<\/strong>, &#8220;Order consolidation for hierarchical product lines&#8221;, Journal of Combinatorial Optimization, DOI: 10.1007\/s10878-012-9538-z, Springer (2012).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Order%20cosolidation%20for%20hierarchical%20product%20lines.pdf\" target=\"_blank\"><\/a><\/li><li><strong>Kyungkuk Lim<\/strong>, Kangbok Lee and\u00a0<strong>Soo Y. Chang<\/strong>, &#8220;Improved bounds for online scheduling with eligibility<br>constraints&#8221;, Theoretical Computer Science, Vol.412, 5211-5224, Elsevier (2011).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Improved%20bounds%20for%20online%20scheduling%20with%20eligibility%20constraints.pdf\" target=\"_blank\"><\/a><\/li><li><strong>Junho Chang, Soo Y. Chang<\/strong>, Sung-Pil Hong, Yun-Hong Min and Myoung-Ju Park, &#8220;Approximation of a Batch Consolidation Problem\u201d, Networks, DOI: 10.1002\/net.20409 (2010).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Approximation%20of%20a%20Batch%20Consolidation%20Problem.pdf\" target=\"_blank\"><\/a><\/li><li>Byung-In Kim,\u00a0<strong>Soo Y. Chang<\/strong>,\u00a0<strong>Junho Chang<\/strong>,\u00a0<strong>Yoontech Han<\/strong>, Jeongin Koo,\u00a0<strong>Kyungkuk Lim<\/strong>, Jaejoon Shin, Sangwon Jeong and\u00a0<strong>Woolahm Kwak<\/strong>, \u201cScheduling of raw-material unloading from ships at a steelworks\u201d, Production Planning &amp; Control, Vol.22, pp. 389-402, Taylor &amp; Francis (2010).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Scheduling%20of%20raw-material%20unloading%20from%20ships%20at%20a%20steelworks.pdf\" target=\"_blank\"><\/a><\/li><li>Sung-Pil Hong, Myoung-Ju Park and\u00a0<strong>Soo Y. Chang<\/strong>, &#8220;Approximation of k-batch consolidation problem&#8221;, Theoretical Computer Science, Vol.410, pp.963-967, Elsevier (2009).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Approximation%20of%20k-batch%20consolidation%20problem.pdf\" target=\"_blank\"><\/a><\/li><li>Patrick N. Bless, Diego Klabjan and\u00a0<strong>Soo Y. Chang<\/strong>, &#8220;Heuristics for automated knowledge source integration and service composition&#8221;, Computers &amp; Operation Research, Vol.35, pp.1292-1314, Elsevier (2008).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Heuristics%20for%20automated%20knowledge%20source%20integration%20and%20service%20composition.pdf\" target=\"_blank\"><\/a><\/li><li>Taebok Kim, Yushin Hong and\u00a0<strong>Soo Young Chang<\/strong>, &#8220;Joint Economic Production-Shipment Policy in a Single-Manufacturer-Multiple-Item System&#8221;, International Journal of Industrial Engineering<em>,\u00a0<\/em>Vol.13, pp.357-363, Elsevier (2006).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Joint%20Economic%20Production-Shipment%20Policy%20in%20a%20Single-Manufacturer-Multiple-Item%20System.pdf\" target=\"_blank\"><\/a><\/li><li><strong>Jongho Park<\/strong>\u00a0,\u00a0<strong>Soo Y. Chang<\/strong>\u00a0and\u00a0<strong>Kangbok Lee<\/strong>, &#8220;Online and semi-online scheduling of two machines under a grade of service provision&#8221;, Operations Research Letters, Vol.34, pp.692-696, Elsevier (2006).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Online%20and%20semi-online%20scheduling%20of%20two%20machines%20under%20a%20grade%20of%20service%20provision.pdf\" target=\"_blank\"><\/a><\/li><li>Taebok Kim, Yushin Hong and\u00a0<strong>Soo Young Chang<\/strong>, &#8220;Joint economic procurement-production-delivery policy for multiple items in a single-manufacturer, multiple-retailer system&#8221;, International Journal of Production Economics, Vol.103, pp.199-208, Elsevier (2006).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Joint%20economic%20procurement-production-delivery%20policy%20for%20multiple%20items%20in%20a%20single-manufacturer%20multiple-retailer%20system.pdf\" target=\"_blank\"><\/a><\/li><li>Won-young Shin,\u00a0<strong>Soo Y. Chang<\/strong>, Jaewook Lee and Chi-Hyuck Jun, &#8220;Frequency Insertion Strategy for Channel Assignment Problem&#8221;, Wireless Networks, Vol.12, pp.45-52, Springer (2006).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Frequency%20Insertion%20Strategy%20for%20Channel%20Assignment%20Problem.pdf\" target=\"_blank\"><\/a><\/li><li><strong>Soo Y. Chang<\/strong>, Hark-Chin Hwang and\u00a0<strong>Sanghyuck Park<\/strong>, &#8220;A two-dimensional vector packing model for the efficient use of coil cassettes&#8221;, Computers and Operations Research, Vol.32, pp.2051-2058, Elsevier (2005).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/A%20two-dimensional%20vector%20packing%20model%20for%20the%20efficient%20use%20of%20coil%20cassettes.pdf\" target=\"_blank\"><\/a><\/li><li>In-Jun Jeong, Kwang-Jae Kim and\u00a0<strong>Soo Y. Chang<\/strong>\u00a0, &#8220;Optimal Weighting of Bias and Variance in Dual Response Surface Optimization&#8221;, Journal of Quality Technology, Vol.37, pp.236-247 (2005).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Optimal%20Weighting%20of%20Bias%20and%20Variance%20in%20Dual%20Response%20Surface%20Optimization.pdf\" target=\"_blank\"><\/a><\/li><li><strong>Soo Y. Chang<\/strong>, Hark-Chin Hwang and\u00a0<strong>Jongho Park<\/strong>, &#8220;Semi-on-Line Parallel Machines Scheduling under Known Total and Largest Processing Times&#8221;, Journal of the Operations Research Society of Japan, Vol.48, pp.1-8 (2005).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Semi-on-Line%20Parallel%20Machines%20Scheduling%20under%20Known%20Total%20and%20Largest%20Processing%20Times.pdf\" target=\"_blank\"><\/a><\/li><li>Hark-Chin Hwang,\u00a0<strong>Kangbok Lee<\/strong>\u00a0and\u00a0<strong>Soo Y. Chang<\/strong>, &#8220;The effect of machine availability on the worst-case performance of LPT&#8221;, Discrete Applied Mathematics, Vol.148, pp.49-61, Elsevier Science B.V. (2005).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/The%20effect%20of%20machine%20availability%20on%20the%20worst-case%20performance%20of%20LPT.pdf\" target=\"_blank\"><\/a><\/li><li>Hark-Chin Hwang and\u00a0<strong>Soo Y. Chang<\/strong>, &#8220;Order consolidation for batch processing&#8221;, Journal of Combinatorial Optimization, Vol. 9, pp.121-138, Springer (2005).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/order%20consolidation%20for%20batch%20processing.pdf\" target=\"_blank\"><\/a><\/li><li>Hark-Chin Hwang,\u00a0<strong>Soo Y. Chang<\/strong>\u00a0and\u00a0<strong>Kangbok Lee<\/strong>, &#8220;Parallel machine scheduling under a Grade of Service provision&#8221;, Computers and Operations Research, Vol.31, pp.2055-2061, Elsevier (2004).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Parallel%20machines%20scheduling%20under%20a%20Grade%20of%20Service%20provision.pdf\" target=\"_blank\"><\/a><\/li><li><strong>Kangbok Lee<\/strong>,\u00a0<strong>Soo Y. Chang<\/strong>\u00a0and Yushin Hong, &#8220;Continuous slab caster scheduling and interval graphs&#8221;, Production Planning and Control, Vol.15, pp.495-501, Taylor &amp; Francis (2004).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Continuous%20slab%20caster%20scheduling%20and%20interval%20graphs.pdf\" target=\"_blank\"><\/a><\/li><li>Hark-Chin Hwang,\u00a0<strong>Soo Y. Chang<\/strong>\u00a0and Yushin Hong, &#8220;A Posterior Competitiveness for List Scheduling Algorithm on Machines with Eligibility Constraints&#8221;, Asia-Pacific Journal of Operational Research, Vol.21, pp.117-125 (2004).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/A%20Posterior%20Competitiveness%20for%20List%20Scheduling%20Algorithm%20on%20Machines%20with%20Eligibility%20Constraints.pdf\" target=\"_blank\"><\/a><\/li><li>Hyungwoo Park , Yushin Hong and\u00a0<strong>Soo Young Chang<\/strong>, &#8220;An efficient scheduling algorithm for the hot coil making in the steel mini-mill&#8221;, Production Planning and Control, Vol.13, pp.298-306, Taylor &amp; Francis (2002).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/An%20efficient%20scheduling%20algorithm%20for%20the%20hot%20coil%20making%20in%20the%20steel%20mini-mill.pdf\" target=\"_blank\"><\/a><\/li><li>C. H. Kim and Y. Hong and\u00a0<strong>Soo Y. Chang<\/strong>, &#8220;Optimal Production Run Length and Inspection Schedules in A Deteriorating Production Process&#8221;, IIE Transactions, Vol.33, pp.421-426, Kluwer Academic Publishers (2001).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Optimal%20Production%20Run%20Length%20and%20Inspection%20Schedules%20in%20A%20Deteriorating%20Production%20Process.pdf\" target=\"_blank\"><\/a><\/li><li>D. Seong,\u00a0<strong>S. Y. Chang<\/strong>\u00a0and Y. Hong , &#8220;An Algorithm for Buffer Allocation with Linear Resource Constraints in a Continuous Flow Production&#8221;, Asia-Pacific Journal of Operational Research, Vol.17, pp.169-180 (2000).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/An%20Algorithm%20for%20Buffer%20Allocation%20with%20Linear%20Resource%20Constraints%20in%20a%20Continuous%20Flow%20Production.pdf\" target=\"_blank\"><\/a><\/li><li><strong>Soo Y. Chang<\/strong>,\u00a0<strong>Myong-Rae Chang<\/strong>\u00a0and Yushin Hong, &#8220;A Lot Grouping Algorithm for Continuous Slab Caster in an Integrated Steel Mill&#8221;, Production Planning and Control, Vol.11, pp.363-368, Taylor &amp; Francis Ltd. (2000).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/A%20Lot%20Grouping%20Algorithm%20for%20Continuous%20Slab%20Caster%20in%20an%20Integrated%20Steel%20Mill.pdf\" target=\"_blank\"><\/a><\/li><li><strong>Myong-Rae Chang<\/strong>\u00a0and\u00a0<strong>Soo Y. Chang<\/strong>, &#8220;A heuristic method for self-healing ring design in a single-homing cluster&#8221;, Telecommunications Systems, Vol.14, pp.175-195, Baltzer Science Publishers (2000).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/A%20heuristic%20method%20for%20self-healing%20ring%20design%20in%20a%20single-homing%20cluster.pdf\" target=\"_blank\"><\/a><\/li><li><strong>Soo Y. Chang<\/strong>, Y Hong, Joong H. Kim and Xere Kim, &#8220;A heuristic algorithm for minimizing maintenance workforce level&#8221;, Production Planning and Control, Vol.10, pp.778-786, Taylor &amp; Francis Ltd. (1999).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/A%20heuristic%20algorithm%20for%20minimizing%20maintenance%20workforce%20level.pdf\" target=\"_blank\"><\/a><\/li><li><strong>Soo Y. Chang<\/strong>\u00a0and\u00a0<strong>Hark-Chin Hwang<\/strong>, &#8220;The Worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines&#8221;, Discrete Applied Mathematics, Vol.92, pp.135-147, Elsevier Science B.V. (1999).<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/The%20Worst-case%20analysis%20of%20the%20MULTIFIT%20algorithm%20for%20scheduling%20nonsimultaneous%20parallel%20machines.pdf\" target=\"_blank\">\u00a0<\/a><\/li><li>Chi-Hyuck Jun and\u00a0<strong>Soo Y. Chang<\/strong>, Yushin Hong, Heejoong Yang, &#8220;A Bayesian approach to prediction of system failure rates by criticalities under event trees&#8221;, International Journal of Production Economics, Vol.60-61, pp.623-628, Elsevier Science B.V. (1999).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/A%20Bayesian%20approach%20to%20prediction%20of%20system%20failure%20rates%20by%20criticalities%20under%20event%20trees.pdf\" target=\"_blank\"><\/a><\/li><li><strong>H.-C. Hwang<\/strong>\u00a0and\u00a0<strong>S. Y. Chang<\/strong>, &#8220;Parallel machines scheduling with machine shutdowns&#8221;, Computers and Mathematics with Application, Vol.36, pp.21-31, Pergamon (1998).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Parallel%20machines%20scheduling%20with%20machine%20shutdowns.pdf\" target=\"_blank\"><\/a><\/li><li>J. Ha, S. Choi, S. Shin, K. Chwa, and\u00a0<strong>S. Chang\u00a0<\/strong>, &#8220;On deciding 3D part disassemblability and surface machinability&#8221;, IIE Transactions, Vol.28, pp.847-854, Kluwer Academic Publishers (1996).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/On%20deciding%203D%20part%20disassemblability%20and%20surface%20machinability.pdf\" target=\"_blank\"><\/a><\/li><li>D. Seong,\u00a0<strong>S. Y. Chang<\/strong>\u00a0and Y. Hong, &#8220;Heuristic Algorithms for Buffer Allocation in A Production Line with Unreliable Machines&#8221;, Int&#8217;l Journal of Production Research, Vol.33, 7, pp.1989-2005 (1995).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/Heuristic%20%20Algorithms%20for%20Buffer%20Allocation%20in%20A%20Production%20Line%20with%20Unreliable%20Machines.pdf\" target=\"_blank\"><\/a><\/li><li>Eui S Jung, Sungjoon Park and\u00a0<strong>Soo Y. Chang<\/strong>, &#8220;A CSP Technique-Based Interactive Control Panel Layout&#8221;, Ergonomics, Vol.38(9), pp.1884-1893 (1995).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/A%20CSP%20Technique-Based%20Interactive%20Control%20Panel%20Layout.pdf\" target=\"_blank\"><\/a><\/li><li><strong>Soo Y. Chang<\/strong>\u00a0and Katta G. Murty, &#8220;The Steepest Descent Gravitational Method For Linear Programming&#8221;, Discrete Applied Mathematics, Vol.25, pp.211-239, North-Holland (1989).\u00a0<a rel=\"noreferrer noopener\" href=\"publication.files\/international\/The%20Steepest%20Descent%20Gravitational%20Method%20For%20Linear%20Programming.pdf\" target=\"_blank\"><\/a><\/li><li>Sung-Jin Chung, Katta G. Murty and\u00a0<strong>Soo Y. Chang<\/strong>, &#8220;On K-triangle&#8221;, Discrete Applied Mathematics, Vol.15, pp.199-211, North-Holland (1986).\u00a0<\/li><\/ul>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4><strong>Domestic Journal Articles<\/strong><\/h4>\n\n\n\n<p><\/p>\n\n\n\n<ul><li><strong>\uc784\uacbd\uad6d<\/strong>, &#8220;Parallel machines scheduling with GoS eligibility constraints : A survey&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0, Vol. 36, pp.248-254 (2010).&nbsp;<a href=\"publication.files\/domestic\/Parallel%20machines%20scheduling%20with%20GoS%20eligibility%20constraints.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li><strong>\ubc15\uc885\ud638<\/strong>,&nbsp;<strong>\uc7a5\uc218\uc601, \uc784\uacbd\uad6d<\/strong>, &#8220;\uc791\uc5c5\uc774 \uc77c\ubc18\uc801\uc778 \uc790\uaca9\uc744 \uac16\ub294 \uc0c1\ud669\uc5d0\uc11c 3\ub300\uc758 \uae30\uacc4\uc640 4\ub300\uc758 \uae30\uacc4\uc758 \uc628\ub77c\uc778 \uc2a4\ucf00\uc904\ub9c1 \ubb38\uc81c\uc5d0 \ub300\ud55c \uc18c\uace0&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0, Vol.35, pp.213-217 (2009).&nbsp;<a href=\"publication.files\/domestic\/\uc791\uc5c5\uc774%20\uc77c\ubc18\uc801\uc778%20\uc790\uaca9\uc744%20\uac16\ub294%20\uc0c1\ud669\uc5d0\uc11c%203\ub300\uc758%20\uae30\uacc4\uc640%204\ub300\uc758%20\uae30\uacc4\uc758%20\uc628\ub77c\uc778%20\uc2a4\ucf00\uc904\ub9c1%20\ubb38\uc81c\uc5d0%20\ub300\ud55c%20\uc18c\uace0.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li><strong>\ubc15\uc885\ud638<\/strong>,&nbsp;<strong>\uc7a5\uc218\uc601, \uc784\uacbd\uad6d<\/strong>, \uac15\uad6c\uc591, &#8220;\ubc15\ud310 \uc5ec\uc7ac \uc2ac\ub77c\ube0c \uc7ac\uace0\uc5d0 \ub300\ud55c \ucd5c\uc801 \ucda9\ub2f9 \ubaa8\ud615&#8221;, \ud55c\uad6d\uacbd\uc601\uacf5\ud559\ud68c\uc9c0, Vol.14, pp.155-168 (2009).<a href=\"publication.files\/domestic\/\ubc15\ud310%20\uc5ec\uc7ac%20\uc2ac\ub77c\ube0c%20\uc7ac\uace0%20\ucd5c\uc801%20\ucda9\ub2f9%20\ubaa8\ud615.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li><strong>\ubc15\uc885\ud638<\/strong>,&nbsp;<strong>\ud55c\uc724\ud0dd<\/strong>, &#8221; \uc81c\ucca0\uc0b0\uc5c5 \uc5f4\uac04\uc555\uc5f0\uacf5\uc815\uc758 \uc77c\uc815\uacc4\ud68d \ubb38\uc81c&#8221;, \ud55c\uad6d\uacbd\uc601\uacf5\ud559\ud68c\uc9c0, Vol.14, pp.69-76 (2009).&nbsp;<a href=\"publication.files\/domestic\/\uc81c\ucca0\uc0b0\uc5c5%20\uc5f4\uac04\uc555\uc5f0\uacf5\uc815\uc758%20\uc77c\uc815\uacc4\ud68d%20\ubb38\uc81c.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li><strong>\ubc15\uc885\ud638<\/strong>,&nbsp;<strong>\uc784\uacbd\uad6d<\/strong>, \uc774\uc815\uc6d0, &#8220;\ucca0\uac15 \ucf54\uc77c\uc81c\ud488 \uc218\uc1a1 \ud314\ub808\ud2b8\uc758 \uc124\uacc4 \ucd5c\uc801\ud654&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0, Vol.34, pp.470-480 (2008).&nbsp;<a href=\"publication.files\/domestic\/\ucca0\uac15%20\ucf54\uc77c\uc81c\ud488%20\uc218\uc1a1%20\ud314\ub808\ud2b8\uc758%20\uc124\uacc4%20\ucd5c\uc801\ud654.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li><strong>\ubc15\uc885\ud638<\/strong>,&nbsp;<strong>\uc784\uacbd\uad6d<\/strong>, \ucd5c\ubd09\ud558, &#8220;The heuristic approach to the order consolidation problem&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0, Vol.34, pp.408-413 (2008).&nbsp;<a href=\"publication.files\/domestic\/The%20heuristic%20approach%20to%20the%20order%20consolidation%20problem.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li><strong>\ubc15\uc885\ud638<\/strong>,&nbsp;<strong>\uc784\uacbd\uad6d<\/strong>, \uae40\uae30\uc131, &#8220;Data Network\uc744 \ud1b5\ud55c \ub2e4\uc218 \ud074\uc544\uc774\uc5b8\ud2b8\ub97c \uc11c\ube44\uc2a4\ud558\ub294 \ubc29\ubc95&#8221;, \ud55c\uad6d\uacbd\uc601\uacf5\ud559\ud68c\uc9c0, Vol.13, pp.73-84 (2008).&nbsp;<a href=\"publication.files\/domestic\/Data%20Network\uc744%20\ud1b5\ud55c%20\ub2e4\uc218%20\ud074\uc544\uc774\uc5b8\ud2b8\ub97c%20\uc11c\ube44\uc2a4\ud558\ub294%20\ubc29\ubc95.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li>\uc815\uae30\ud6a8,&nbsp;<strong>\uc7a5\uc900\ud638<\/strong>, \uc774\uc6d0\uc12d,&nbsp;<strong>\ud55c\uc724\ud0dd<\/strong>, \uc720\ud76c\ucc9c,&nbsp;<strong>\uc7a5\uc218\uc601<\/strong>, \uc804\uce58\ud601, &#8220;\ud601\uc2e0\uc81c\ud488\uac1c\ubc1c \uad50\uc721\uacfc\uc815 \uac1c\ubc1c\uc744 \uc704\ud55c \uc804\ub7b5\uc218\ub9bd \ubc29\ubc95&#8221;, \uacf5\ud559\uad50\uc721\uc5f0\uad6c, 11(3), pp.5-11 (2008).<\/li><li><strong>\uc7a5\uc218\uc601<\/strong>, \ud64d\uc720\uc2e0, \uae40\uc911\ud76c,&nbsp;<strong>\uae40\uc138\ub798<\/strong>, &#8220;\uc815\ube44\uc791\uc5c5 \uc778\ub825 \uc218\uc900 \ucd5c\uc18c\ud654\ub97c \uc704\ud55c \ubc1c\uacac\uc801 \uae30\ubc95&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0, Vol.25, pp.47-55 (1999).&nbsp;<a href=\"publication.files\/domestic\/\uc815\ube44\uc791\uc5c5%20\uc778\ub825%20\uc218\uc900%20\ucd5c\uc18c\ud654\ub97c%20\uc704\ud55c%20\ubc1c\uacac\uc801%20\uae30\ubc95.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li>\ubc15\ud615\uc6b0, \ud64d\uc720\uc2e0,&nbsp;<strong>\uc7a5\uc218\uc601<\/strong>, \ud669\uc0bc\uc131, &#8220;\ucca0\uac15 Mini Mill \uc5d0\uc11c\uc758 \ud6a8\uc728\uc801\uc778 \uc791\uc5c5 \ub2e8\uc704 \ud3b8\uc131&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0, Vol.24, pp.649-660 (1998).&nbsp;<a href=\"publication.files\/domestic\/\ucca0\uac15%20Mini%20Mill%20\uc5d0\uc11c\uc758%20\ud6a8\uc728\uc801\uc778%20\uc791\uc5c5%20\ub2e8\uc704%20\ud3b8\uc131.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li>\uc774\uc720\uadfc, \ubc31\uc120\ub355, \ubc30\uc131\ubb38, \uc804\uce58\ud601,&nbsp;<strong>\uc7a5\uc218\uc601<\/strong>, \ucd5c\uc778\uc900, &#8220;\ub2e8\uc77c \uae30\uacc4 \uc77c\uc815\uacc4\ud68d\uc744 \uc704\ud55c \uc81c\uc57d\uc870\uac74 \ud45c\ud604\uc5b8\uc5b4 \ubc0f \ucf54\ub4dc \uc790\ub3d9 \uc0dd\uc131\uae30&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0, Vol.22, pp.209-229 (1996).&nbsp;<a href=\"publication.files\/domestic\/\ub2e8\uc77c%20\uae30\uacc4%20\uc77c\uc815\uacc4\ud68d\uc744%20\uc704\ud55c%20\uc81c\uc57d\uc870\uac74%20\ud45c\ud604\uc5b8\uc5b4%20\ubc0f%20\ucf54\ub4dc%20\uc790\ub3d9%20\uc0dd\uc131\uae30.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li>\uc131\ub355\ud604,&nbsp;<strong>\uc7a5\uc218\uc601<\/strong>, \ud64d\uc720\uc2e0, &#8220;\uc790\uc6d0\uc81c\uc57d\uc870\uac74\uc744 \uac16\ub294 \uc5f0\uc18d\ud750\ub984\ub77c\uc778\uc5d0\uc11c\uc758 Buffer \ud560\ub2f9\uc5d0 \uad00\ud55c \uc5f0\uad6c&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0, Vol.21, pp.541-553 (1995).&nbsp;<a href=\"publication.files\/domestic\/\uc790\uc6d0\uc81c\uc57d\uc870\uac74\uc744%20\uac16\ub294%20\uc5f0\uc18d\ud750\ub984\ub77c\uc778\uc5d0\uc11c\uc758%20Buffer%20\ud560\ub2f9\uc5d0%20\uad00\ud55c%20\uc5f0\uad6c.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li>\ubc15\uc131\uc900, \uc815\uc758\uc2b9,&nbsp;<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\uc81c\uc57d\ub9cc\uc871 \uc54c\uace0\ub9ac\uc998\uc744 \uc774\uc6a9\ud55c \uc0c1\ud638\ub300\ud654\uc801 \uc870\uc885\ud328\ub110 \ubc30\uce58&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0, Vol.20, pp.85-97 (1994).&nbsp;<a href=\"publication.files\/domestic\/\uc81c\uc57d\ub9cc\uc871%20\uc54c\uace0\ub9ac\uc998\uc744%20\uc774\uc6a9\ud55c%20\uc0c1\ud638\ub300\ud654\uc801%20\uc870\uc885\ud328\ub110%20\ubc30\uce58.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li>\uc804\uce58\ud601, \uc591\ud76c\uc911,&nbsp;<strong>\uc7a5\uc218\uc601<\/strong>, \uc815\uc758\uc2b9, \uc784\ud61c\ub780, &#8220;\ubca0\uc774\uc9c0\uc548\uae30\ubc95\uc5d0 \uc758\ud55c \uc784\ubb34 \uc2e0\ub8b0\ub3c4 \uc608\uce21&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0, Vol.18, pp.71-78 (1993).&nbsp;<a href=\"publication.files\/domestic\/\ubca0\uc774\uc9c0\uc548\uae30\ubc95\uc5d0%20\uc758\ud55c%20\uc784\ubb34%20\uc2e0\ub8b0\ub3c4%20\uc608\uce21.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li>\uc804\uce58\ud601, \uc774\uc2b9\ub9cc, \ubc15\ucca0\uc21c, \uac15\uc0c1\uc5fd,&nbsp;<strong>\uc7a5\uc218\uc601<\/strong>, \ucd5c\uc778\uc900, \uac15\uc804\ud0dc, &#8220;\ub0c9\uc5f0 \uacf5\uc815\uc5d0\uc11c\uc758 \uc791\uc5c5\ub2e8\uc704 \ud3b8\uc131&#8221;, \uc0b0\uc5c5\uacf5\ud559 Interface, Vol.6, pp.117-131 (1993).&nbsp;<a href=\"publication.files\/domestic\/\ub0c9\uc5f0%20\uacf5\uc815\uc5d0\uc11c\uc758%20\uc791\uc5c5\ub2e8\uc704%20\ud3b8\uc131.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li>\ucd5c\ud601\uc900,&nbsp;<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\uc120\ud615\uacc4\ud68d\uc744 \uc704\ud55c \uc30d\ub300 \uc2e0\uacbd\ub9dd&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c\uc9c0, Vol.17, pp.3-16 (1992).&nbsp;<a href=\"publication.files\/domestic\/\uc120\ud615\uacc4\ud68d\uc744%20\uc704\ud55c%20\uc30d\ub300%20\uc2e0\uacbd\ub9dd.pdf\" target=\"_blank\" rel=\"noreferrer noopener\"><\/a><\/li><li><strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\ube44\uc120\ud615\uacc4\ud68d\ubc95\uc744 \uc774\uc6a9\ud55c \ub300\uaddc\ubaa8 \uc120\ud615\uacc4\ud68d\ud574\ubc95\uc758 \uac1c\ubc1c&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\uc9c0, Vol.17, pp.131-142 (1991).&nbsp;<\/li><\/ul>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4>International Conference Papers<\/h4>\n\n\n\n<p><\/p>\n\n\n\n<ul><li>Byung-In Kim,&nbsp;<strong>Soo Y. Chang<\/strong>, &#8220;Raw-material unloading at a steelworks&#8221;, ICOVACS 2009, University of Louisville , Louisville, (2009. 10. 20). (GE Best Paper Award)<\/li><li><strong>Yunetech Han<\/strong>,&nbsp;<strong>Soo Y. Chang<\/strong>, Byung-In Kim,<strong>&nbsp;Kyung-Kuk Lim<\/strong>,&nbsp;<strong>Woolahm Kwak<\/strong>, &#8220;The Raw Material Unloading Problem of a Steelworks: Combinatorial Nature&#8221;, INFORMS 2007, INFORMS, SEATTLE (2007.11.04)<\/li><li><strong>Juneho Chang<\/strong>,&nbsp;<strong>Soo Y. Chang<\/strong>, Byung-In Kim, Jeongin Koo, Jaejoon Shin, Sangwon Jeoung, &#8220;The Raw Material Unloading Problem of a Steelworks: a Solution Approach&#8221;, INFORMS 2007, INFORMS, SEATTLE (2007.11.05)<\/li><li><strong>Yune T. Han<\/strong>,&nbsp;<strong>Soo Y. Chang<\/strong>, Diego Klabjan,&nbsp;<strong>Jongho Park<\/strong>, &#8220;Transportation Problems Involving Trailers and Tractors&#8221;, INFORMS 2006, INFORMS, PITTSBURGH (2006.11.05).<\/li><li><strong>June-Ho Chang<\/strong>,&nbsp;<strong>Soo Y. Chang<\/strong>, &#8220;Combinatorial Problems Related to Order Consolidation&#8221;, INFORMS 2006, INFORMS, PITTSBURGH (2006.11.05).<\/li><li>Diego Klabjan, Patrick Bless,&nbsp;<strong>Soo Chang<\/strong>, &#8220;Exact and Heuristic Approaches to the Component Set Identification Problem&#8221;,INFORMS 2004 Denver Proceedings, INFORMS (2004.10.24 &#8211; 2004.10.27).<\/li><li>In-Jun Jeong,&nbsp;<strong>Soo Y. Chang<\/strong>. Kwang-Jae Kim, &#8220;Assessing the Relative Weights of Bias and Variance in Dual Response Surface Problem&#8221;,INFORMS Proceedings, INFORMS (2003.10.18 &#8211; 2003.10.22).<\/li><li>Hark-Chin Hwang,&nbsp;<strong>Kangbok Lee<\/strong>,&nbsp;<strong>Soo Y. Chang<\/strong>, &#8220;Parallel Machine Scheduling with General Machine Shutdowns&#8221;, Proceedings of APIEMS,Taipei, Taiwan (2002.11.18).<\/li><li><strong>Soo Y<\/strong>. Chang, D&nbsp;<strong>Kang, J Lee<\/strong>,&nbsp;<strong>J Park<\/strong>, &#8220;Steel Product Out-bound Logistics&#8221;,INFORMS, San Jose, California, USA (2002.11.17 &#8211; 2002.11.20).<\/li><li>Hark-Chin Hwang,&nbsp;<strong>Soo Y. Chang<\/strong>, Yushin Hong, &#8220;On-Line Parallel Machine Scheduling under Machine Eligibility Constraints: Posterior Competitiveness&#8221;,Proceedings of IJIE,IJIE, Busan, Korea (2002.10.24).<\/li><li><strong>Soo Y. Chang<\/strong>,&nbsp;<strong>Kang-bok Lee<\/strong>, Tae-gyoon Joh, &#8220;Packing Problems for Scheduling Steel Manufacturing Processes&#8221;, INFORMS-KORMS,Seoul Korea (2000.01.01 &#8211; ).<\/li><li><strong>Soo Y. Chang<\/strong>,&nbsp;<strong>Kangbok Lee<\/strong>, Taegyun Cho, &#8220;The use of interval graphs for the steel-mill scheduling problems&#8221;,INFORMS,Salt Lake City, USA (2000.01.01 &#8211; ).<\/li><li><strong>Soo Y. Chang<\/strong>,&nbsp;<strong>Kangbok Lee<\/strong>, Taegyun Cho, &#8220;A Vector Sequencing Approach for the Steel Manufacturing Process Scheduling&#8221; ,INFORMS (1999.01.01 &#8211; ).<\/li><li>H. Park, Y. Hong,&nbsp;<strong>S. Y. Chang<\/strong>&nbsp;and S. Hwang, &#8220;An Efficient Scheduling Algorithm for Steel Making in Mini Mill&#8221;, 14th International Conference on Production Research, Vol.1, pp.454-457, Osaka, Japan (1997.08.04).<\/li><li>Jun, Chi-Hyuck,&nbsp;<strong>Soo Y. Chang<\/strong>, Yushin Hong and Heejoong Yang, &#8220;A Bayesian Approach to Prediction of System Failure Rates by Criticalities under Event Trees&#8221;, 14th International Conference on Production Research, Vol.1, pp.710-713, Osaka, Japan (1997.08.04).<\/li><li>Choi, Woo-Yong,&nbsp;<strong>Soo Y. Chang<\/strong>&nbsp;and Chi-Hyuck Jun, &#8220;Determination of Feasible Region Existency in Convex Nonlinear Programming&#8221;, Proceedings of 20th Int&#8217;l Conference on Computers &amp; Industrial Engineering, pp.469-472, Kyongju, Korea (1996.10.06).<\/li><li><strong>Soo Y. Chang<\/strong>, and&nbsp;<strong>Hark-Chin Hwang<\/strong>, &#8220;Deterministic Multiple Machine Scheduling under Machine Elligibility Constraints&#8221;, International Conference on Management Science and Economic Development of China, Vol.1, pp.63-71, Hong Kong Univ. of Science and Tech. (1996.07.16).<\/li><li><strong>Soo Y. Chang<\/strong>,&nbsp;<strong>Hark-Chin Hwang<\/strong>, and Katta Murty, &#8220;Combinatorial Optimization in Modern Manufacturing&#8221;, International Conference on Management Science and Economic Development of China, Vol.1, pp.104-114, Hong Kong Univ. of Science and Tech. (1996.07.16).<\/li><li>C. -H. Jun,&nbsp;<strong>S. Y. Chang,<\/strong>&nbsp;Y. Hong and H. Yang, &#8220;Bayesian Reliability Prediction Under Event Trees&#8221;, Proc. of the 2nd SSAT Int&#8217;l Conf. on Reliability &amp; Quality in Design, pp.113-117, Orlando (1995.03).<\/li><li>In Jun Choi, C.H. Jun,&nbsp;<strong>S.Y. Chang<\/strong>, S.Y. Kang, S.M. Bae, &#8220;A Decision Support System for Optical Fiber Telecommunication Network Design&#8221;, Proc. of 3rd Conference of Association of Asian-Pacific OR Societies, Fukuoka, Japan (1994.07).<\/li><li><strong>S. Y. Chang<\/strong>, I. J. Choi, &#8220;A Job Sequencing System for Cold Coil Production Process&#8221;, TIMS\/ORSA, pp.109, Boston, USA (1994).<\/li><li><strong>S. Y. Chang<\/strong>, Y. Hong and C. -H. Jun, &#8220;Constraint Satisfaction Approach to Scheduling DHCR Process&#8221;, Int&#8217;l Conf. on Computerized Production Control in Steel Plant, pp.464-470, Seoul (1993.11).<\/li><li>Y. Hong, D. Jeon and&nbsp;<strong>S. Y. Chang<\/strong>, &#8220;The Analysis of a Continuous Production Line with Unreliable Machines&#8221;, Int&#8217;l Symp. on Intelligent Process Automation, , pp.263-283, Taejon (1992.01).<\/li><\/ul>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4>Domestic Conference Papers<\/h4>\n\n\n\n<p><\/p>\n\n\n\n<ul><li><strong>\uc784\uacbd\uad6d<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8221; \uc791\uc5c5\uc774 GoS \uc790\uaca9\uc744 \uac00\uc9c0\ub294 \uc0c1\ud669\uc5d0\uc11c\uc758 \uc2a4\ucf00\uc904\ub9c1 \ubb38\uc81c\uc758 \ucd5c\uc2e0 \ub3d9\ud5a5&#8221;, 2010 \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \ucd94\uacc4\ud559\uc220\ub300\ud68c, \ub3d9\uad6d\ub300\ud559\uad50, \uc11c\uc6b8 (2010.11).<\/li><li><strong>\ubc15\uc885\ud638<\/strong>,\u00a0<strong>\uacfd\uc6b0\ub78c<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601,<\/strong>\u00a0&#8220;\ub124\ud2b8\uc6cc\ud06c \uc2a4\uc704\uce58\ub514\uc790\uc778\uc5d0\uc11c \ub098\ud0c0\ub098\ub294 \uadf8\ub798\ud504\uc758 \uc774\ub860\uc801 \ud2b9\uc131&#8221;, 2009 \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c\/\ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c, \ubd80\uc0b0\ub300\ud559\uad50, \ubd80\uc0b0 (2009.05).<\/li><li><strong>\uc7a5\uc218\uc601<\/strong>\u00a0&#8220;\uacf5\ud559\uc758 \ub300\uc0c1\uc73c\ub85c\uc11c\uc758 \uc11c\ube44\uc2a4&#8221;, 2009 \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c\/\ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c, \ubd80\uc0b0\ub300\ud559\uad50, \ubd80\uc0b0 (2009.05).<\/li><li><strong>\uc784\uacbd\uad6d<\/strong>,\u00a0<strong>\ubc15\uc885\ud638<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;The Analysis of Algorithm for Four Machines Scheduling with General Eligibility&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c 2008 \ucd94\uacc4\ud559\uc220\ub300\ud68c, \ud55c\uc591\ub300\ud559\uad50, \uc11c\uc6b8 (2008.11).<\/li><li><strong>\uc7a5\uc900\ud638<\/strong>,\u00a0<strong>\uacfd\uc6b0\ub78c<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\uad6c\uac04\uadf8\ub798\ud504\uc5d0\uc11c \uc8fc\ubb38\ud1b5\ud569 \ucd5c\ub300 \uc120\ud0dd \ubb38\uc81c\uc758 \ubcf5\uc7a1\ub3c4 \uaddc\uba85&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c 2008 \ucd94\uacc4\ud559\uc220\ub300\ud68c, \ud55c\uc591\ub300\ud559\uad50, \uc11c\uc6b8 (2008.11).<\/li><li><strong>\uc784\uacbd\uad6d<\/strong>,\u00a0<strong>\ubc15\uc885\ud638<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;The Analysis of Algorithm for Three Machines Scheduling with General Eligibility&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2007 \ucd94\uacc4\ud559\uc220\ub300\ud68c, \ud55c\uc591\ub300\ud559\uad50, \uc11c\uc6b8 (2007.11).<\/li><li><strong>\uc804\ud61c\ubbfc<\/strong>,\u00a0<strong>\uacfd\uc6b0\ub78c<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\uc0b0\uc5c5\uacf5\ud559\uc758 \uc11c\ube44\uc2a4 \uacfc\ud559\uc5d0\uc758 \uae30\uc5ec\ub97c \uc704\ud55c \uc11c\ube44\uc2a4 \uc815\uc758&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2007 \ucd94\uacc4\ud559\uc220\ub300\ud68c, \ud55c\uc591\ub300\ud559\uad50, \uc11c\uc6b8 (2007.11).<\/li><li>\uae40\ubcd1\uc778,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>,\u00a0<strong>\uc7a5\uc900\ud638<\/strong>,\u00a0<strong>\ud55c\uc724\ud0dd<\/strong>, \uad6c\uc815\uc778,\u00a0<strong>\uc784\uacbd\uad6d<\/strong>, \uc2e0\uc7ac\uc900, \uc815\uc0c1\uc6d0,\u00a0<strong>\uacfd\uc6b0\ub78c<\/strong>, &#8220;A raw-material unloading scheduling system for an integrated steel mill&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2007 \ucd94\uacc4\ud559\uc220\ub300\ud68c, \ud55c\uc591\ub300\ud559\uad50, \uc11c\uc6b8 (2007.11).<\/li><li>\ubbfc\uc724\ud64d, \ud64d\uc131\ud544, \uad8c\uc21c\uc6b0, \ucd5c\ubcd1\ucc9c,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;Maximum batch cover for order consolidation&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2007 \ucd94\uacc4\ud559\uc220\ub300\ud68c, \ud55c\uc591\ub300\ud559\uad50, \uc11c\uc6b8 (2007.11).<\/li><li><strong>\ucd5c\ubd09\ud558<\/strong>,\u00a0<strong>\uc7a5\uc900\ud638<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\uc8fc\ubb38 \ud1b5\ud569 \ubb38\uc81c\uc5d0 \ub300\ud55c \ubc1c\uacac\uc801 \uae30\ubc95&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c 2007 \ucd94\uacc4\ud559\uc220\ub300\ud68c, \uac74\uad6d\ub300\ud559\uad50, \uc11c\uc6b8 (2007.11).<\/li><li><strong>\ubc15\uc885\ud638<\/strong>,\u00a0<strong>\uc784\uacbd\uad6d<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;Scheduling of Three Identical Machines under General Eligibility&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c 2007 \ucd94\uacc4\ud559\uc220\ub300\ud68c, \uac74\uad6d\ub300\ud559\uad50, \uc11c\uc6b8 (2007.11).<\/li><li><strong>\ud55c\uc724\ud0dd<\/strong>,\u00a0<strong>\ubc15\uc885\ud638<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\uc81c\ucca0\uc0b0\uc5c5 \uc5f4\uac04\uc555\uc5f0\uacf5\uc815 \uc77c\uc815\uacc4\ud68d\uc744 \uc704\ud574 \uc815\uc758\ub41c \uacbd\ub85c\ubd84\ud560 \ubb38\uc81c&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c 2007 \ucd94\uacc4\ud559\uc220\ub300\ud68c, \uac74\uad6d\ub300\ud559\uad50, \uc11c\uc6b8 (2007.11).<\/li><li><strong>\uc7a5\uc900\ud638<\/strong>, \uc774\uc6d0\uc12d, \uc815\uae30\ud6a8, \uc7a5\uc900\ud638<strong>, \uc7a5\uc218\uc601<\/strong>, \uc720\ud76c\ucc9c, \uc804\uce58\ud601, &#8220;\ud601\uc2e0\uc81c\ud488\uac1c\ubc1c \ubaa8\ub4c8 \uad50\uc721\uacfc\uc815 \uac1c\ubc1c\uc744 \uc704\ud55c \uc804\ub7b5\uc801 \uc811\uadfc \ubc0f \uc801\uc6a9&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c 2006 \ucd94\uacc4\ud559\uc220\ub300\ud68c, \uace0\ub824\ub300\ud559\uad50, \uc11c\uc6b8 (2006.11).<\/li><li><strong>\uc7a5\uc900\ud638<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\ub2e8\uc704\uc791\uc5c5 \ud3b8\uc131 \ubb38\uc81c\uc758 Worst Case \ubd84\uc11d&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2006 \ucd94\uacc4 \uacbd\uc601\uacfc\ud559\ud68c, \uc11c\uc6b8\ub300\ud559\uad50, \uc11c\uc6b8 (2006.11).<\/li><li><strong>\ud55c\uc724\ud0dd<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\ud2b8\ub808\uc77c\ub7ec-\ud2b8\ub809\ud130\ubb38\uc81c\uc5d0 \ub300\ud55c \uc5f0\uad6c&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2006 \ucd94\uacc4 \uacbd\uc601\uacfc\ud559\ud68c, \uc11c\uc6b8\ub300\ud559\uad50, \uc11c\uc6b8 (2006.11).<\/li><li><strong>\uc7a5\uc218\uc601<\/strong>, \uae40\ubcd1\uc778, &#8220;\uc77c\uad00\uc81c\ucca0\uc18c \uc6d0\ub8cc \ubd80\ub450 \ud558\uc5ed \uc77c\uc815\uacc4\ud68d \ucd5c\uc801\ud654 \ubaa8\ud615&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2006 \ucd94\uacc4 \uacbd\uc601\uacfc\ud559\ud68c, \uc11c\uc6b8\ub300\ud559\uad50, \uc11c\uc6b8 (2006.11).<\/li><li>\uc774\uc6d0\uc12d,\u00a0<strong>\uc7a5\uc900\ud638<\/strong>, \uc7a5\uc900\ud638, \uc720\uc2dc\uc6d0, \uc720\ud76c\ucc9c,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \uc804\uce58\ud601, &#8220;\ud601\uc2e0\uc81c\ud488\uac1c\ubc1c \ubaa8\ub4c8 \uad50\uc721\uacfc\uc815 \uad6c\ucd95\uc744 \uc704\ud55c stakeholder\uc758 \uc694\uad6c\uc0ac\ud56d \ud30c\uc545&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\/\ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2006 \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c, KAIST, \ub300\uc804 (2006.05).<\/li><li>\ubb38\uc815\ud0dc, \uc815\uae30\ud6a8,\u00a0<strong>\ud55c\uc724\ud0dd<\/strong>, \uc720\ud76c\ucc9c,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \uc804\uce58\ud601, \uc815\ubb34\uc601, &#8220;\uad6d\ub0b4\uc678 \ub300\ud559\uc758 \uc81c\ud488 \uc124\uacc4 \ubc0f \uac1c\ubc1c \uad50\uc721 \uacfc\uc815 \ubca4\uce58\ub9c8\ud0b9&#8221;, \ub300\ud559\uc0b0\uc5c5\uacf5\ud559\ud68c\/\ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2006 \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c, KAIST, \ub300\uc804 (2006.05).<\/li><li><strong>\ubc15\uc0c1\ud601<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8221; \ud6c4\ud310 \ub0a0\ud310\uc124\uacc4\ub97c \uc704\ud55c \uc774\ucc28\uc6d0 \ube48\ud328\ud0b9 \ucd5c\uc801\ud654 \uae30\ubc95&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\/\ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2006 \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c, KAIST, \ub300\uc804 (2006.5).<\/li><li><strong>\uc7a5\uc900\ud638<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\ud6a8\uc728\uc801 \uc8fc\ubb38\uc9d1\uc57d\uc744 \uc704\ud55c \ub2e8\uc704\uc791\uc5c5 \ud3b8\uc131&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\/\ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2006 \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c, KAIST, \ub300\uc804 (2006.5).<\/li><li><strong>\ud55c\uc724\ud0dd<\/strong>,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\ud2b8\ub808\uc77c\ub7ec\uc640 \ud2b8\ub809\ud130\ub97c \uc0ac\uc6a9\ud558\ub294 \uc6b4\uc1a1\ubb38\uc81c \ubd84\uc11d&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\/\ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2006 \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c, KAIST, \ub300\uc804 (2006.5).<\/li><li>\uc815\uc778\uc900, \uae40\uad11\uc7ac,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\uc30d\ub300\ubc18\uc751\ud45c\uba74 \ucd5c\uc801\ud654\uc5d0\uc11c \ud3b8\ucc28\uc640 \ubd84\uc0b0\uc758 \uac00\uc911\uce58 \uacb0\uc815\uc5d0 \uad00\ud55c \uc5f0\uad6c&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 2004 \ucd98\uacc4 \ud559\uc220\ub300\ud68c, \uc804\ubd81\ub300\ud559\uad50, \uc804\uc8fc (2004.05).<\/li><li>\ubc15\uc885\ud601, \ud64d\uc720\uc2e0,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\ub2e4\ud488\ubaa9 \ubcd1\ub82c \ubc30\ucde8\uc124\ube44\uc5d0\uc11c\uc758 Dynamic Lot Sizing&#8221;, 1998 \ucd94\uacc4 \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \ub17c\ubb38\uc9d1, pp.318-322, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c (1998.10).<\/li><li>\uae40\uc911\ud76c,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;Applying Bin Packing Heuristics to the Repair Manpower Assignment in Steel Industry&#8221; , \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c \ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1, \ud64d\uc775\ub300\ud559\uad50, \uc11c\uc6b8 (1997.11).<\/li><li>\uc804\uce58\ud601,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \ud64d\uc720\uc2e0, \uc591\ud76c\uc911, &#8220;Event Tree \ub97c \uc774\uc6a9\ud55c \uce58\uba85\ub3c4\uc5d0 \ub530\ub978 \uc2dc\uc2a4\ud15c \uace0\uc7a5\ub960\uc758 \ubca0\uc774\uc9c0\uc548 \ubd84\uc11d&#8221;, 1996 \ub300\ud55c\uc124\ube44\uad00\ub9ac\ud559\ud68c \ucc3d\ub9bd \ud559\uc220\ubc1c\ud45c\ub300\ud68c \ub17c\ubb38\uc9d1, pp.88-93, \uc544\uc8fc\ub300\ud559\uad50, \uc218\uc6d0 (1996.11).<\/li><li>\ubc15\ud615\uc6b0, \ud55c\uc2b9\uc544, \ud669\uc0bc\uc131, \ud64d\uc720\uc2e0,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\ucca0\uac15 Mini Mill \uc5d0\uc11c\uc758 \uc0dd\uc0b0 \uc77c\uc815\uacc4\ud68d \uc2dc\uc2a4\ud15c&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c &#8217;96 \ucd94\uacc4\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1, pp.27-31, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c (1996.11).<\/li><li>\ubc15\uc131\uc900, \uc870\ud56d\uc900, \uc815\uc758\uc2b9,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;Constraint Satisfaction Problem \uae30\ubc95\uc744 \uc774\uc6a9\ud55c \uc870\uc885\ud328\ub110 \uc124\uacc4\ubc29\ubc95&#8221;, \ub300\ud55c\uc778\uac04\uacf5\ud559\ud68c \ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1, pp.75-pp.84, \ub3d9\uc544\ub300\ud559\uad50 (1996.04).<\/li><li>\uc2e0\ub3d9\ubbfc, \ubc15\ud615\uc6b0, \ud64d\uc720\uc2e0,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\ucca0\uac15 Mini Mill \uacf5\uc815\uc758 \uc0dd\uc0b0\uc77c\uc815\uacc4\ud68d&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c &#8217;95 \ucd94\uacc4\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1 , pp.238-243, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c (1995.10).<\/li><li>\uc774\uc720\uadfc, \uc774\uc2b9\ub9cc, \uc804\uce58\ud601, \ucd5c\uc778\uc900,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\uc5f0\uc18d\uc18c\ub454 \uacf5\uc815\uc758 \uc791\uc5c5\ub2e8\uc704 \ud3b8\uc131\uc744 \uc704\ud55c \ubc1c\uacac\uc801 \uae30\ubc95&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c\/\ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 1994 \ub144 \ucd98\uacc4 \uacf5\ub3d9 \ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1, pp.280~287, \ucc3d\uc6d0 (1994.04).<\/li><li>\ubc15\uc131\uc900, \uc815\uc758\uc2b9,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \uc870\ud56d\uc900, &#8220;An Interactive and Iterative Control Panel Layout&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c\/\ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \uacf5\ub3d9\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1, \ucc3d\uc6d0 (1994.04).<\/li><li>\uc774\uc601\uc5fd, \ub3c4\ub0a8\ucca0,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \ucd5c\uc778\uc900, \uc815\ubb34\uc601, \ubc15\ucd98\ub82c, &#8220;\uc9c0\uc2dd\ubca0\uc774\uc2a4\ub97c \uc774\uc6a9\ud55c CAD \ub3c4\uba74\uc5d0\uc11c\uc758 BOM \uc790\ub3d9 \uc0dd\uc131&#8221;, 1993 \ub144 \ud55c\uad6d\uc790\ub3d9\uc81c\uc5b4 \ud559\ud68c \ucd94\uacc4 \ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1, pp.151~155, \uc11c\uc6b8 (1993.10).<\/li><li>\ucd5c\uc778\uc900, \uc804\uce58\ud601,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \uc774\uc720\uadfc, \uc774\uc2b9\ub9cc, &#8220;CSP \uc5d0 \uadfc\uac70\ud55c \uc77c\uc815\uacc4\ud68d \uc5b8\uc5b4 \uac1c\ubc1c\uc5d0 \uad00\ud55c \uc5f0\uad6c&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c 1993 \ub144 \ucd94\uacc4\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1 , pp.550, \uc11c\uc6b8 (1993.10).<\/li><li>\uc815\ubb34\uc601,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \ucd5c\uc778\uc900, \ub3c4\ub0a8\ucca0, \uc774\uc601\uc5fd, &#8220;Bar Code \uc2dc\uc2a4\ud15c\uacfc \uc5f0\uacc4\ud55c \uc2e4\uc2dc\uac04 \uc7ac\uace0 \/ \ucd9c\uace0 \uad00\ub9ac \uc2dc\uc2a4\ud15c \uac1c\ubc1c&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c 1993 \ub144 \ucd94\uacc4\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1 , pp.625, \uc11c\uc6b8 (1993.10).<\/li><li>\uac15\uc0c1\uc5fd, \ucd5c\uc778\uc900, \uc804\uce58\ud601,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \uc7a5\uba85\ub798, \ubc30\uc131\ubb38, &#8220;\uad11\ud1b5\uc2e0\ub9dd \uc124\uacc4 \uc758\uc0ac\uacb0\uc815 \uc9c0\uc6d0 \uc2dc\uc2a4\ud15c \uac1c\ubc1c&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1, \uc11c\uc6b8\uc0b0\uc5c5\ub300\ud559\uad50, (1993.10).<\/li><li>\ucd5c\uc778\uc900, \uc804\uce58\ud601,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \ucd5c\ubb38\uc218, \uc548\uc601\uc2e0, \uac15\uc0c1\uc5fd, &#8220;\ud1b5\uc2e0\ub9dd \ucd5c\uc801\uc124\uacc4 \ubc0f \uc131\ub2a5\uc608\uce21\uc744 \uc704\ud55c \uc758\uc0ac\uacb0\uc815\uc9c0\uc6d0 \uc2dc\uc2a4\ud15c&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c &#8211; \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c 1993 \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1 , \ub300\uad6c (1993.04).<\/li><li>\uc774\uc2b9\ub9cc, \ubc15\ucca0\uc21c, \uc804\uce58\ud601,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \ucd5c\uc778\uc900, &#8220;\ub0c9\uc5f0\uacf5\uc815\uc5d0\uc11c\uc758 \uc791\uc5c5\ub2e8\uc704 \ud3b8\uc131&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c &#8211; \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c 1993 \ucd98\uacc4\uacf5\ub3d9\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1 , \ub300\uad6c (1993.04).<\/li><li>\uc804\uce58\ud601,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \ucd5c\uc778\uc900, \uac15\uc0c1\uc5fd, \uc548\uc601\uc2e0, \uac15\uc0c1\uc5fd, &#8220;Constraint Logic Programming \uc758 \uc77c\uc815\uacc4\ud68d \uc751\uc6a9&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c 1992 \ub144 \ucd94\uacc4\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1 , \uc11c\uc6b8 (1992.09).<\/li><li>\ucd5c\uc6b0\uc6a9,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \ud64d\uc720\uc2e0, \uc804\uce58\ud601, &#8220;\uc120\ud615\uacc4\ud68d\uc744 \uc704\ud55c \ubc18\ubcf5\uae30\ubc95\uc5d0 \uad00\ud55c \uc5f0\uad6c&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c\/\ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \uacf5\ub3d9\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1, \uc6b8\uc0b0\ub300\ud559\uad50, (1992.05).<\/li><li><strong>\uc7a5\uc218\uc601<\/strong>, \uc624\uad6c\uc77c, \uae40\uad11\uc218, &#8220;\uc120\ud615\uacc4\ud68d\uc758 CAD\/CAM \uc751\uc6a9&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c\/\ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \uacf5\ub3d9\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1, \uc6b8\uc0b0\ub300\ud559\uad50, (1992.05).<\/li><li>\uae40\uba85\uc218,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, \ud64d\uc720\uc2e0, \uc804\uce58\ud601, &#8220;Scheduling Vehicles on Track&#8221;, \ud55c\uad6d\uacbd\uc601\uacfc\ud559\ud68c\/\ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c \uacf5\ub3d9\ud559\uc220\ub300\ud68c \ub17c\ubb38\uc9d1, \uc6b8\uc0b0\ub300\ud559\uad50, (1992.05).<\/li><li>\uae40\uc885\uae30, \ud64d\uc720\uc2e0,\u00a0<strong>\uc7a5\uc218\uc601<\/strong>, &#8220;\uc77c\uc815\uacc4\ud68d \ubb38\uc81c\ub97c \uc704\ud55c Constraint Satisfaction Problem Technique \uc758 \uc751\uc6a9&#8221;, \ub300\ud55c\uc0b0\uc5c5\uacf5\ud559\ud68c &#8217;91 \ucd94\uacc4\ud559\uc220\ub300\ud68c\ub17c\ubb38\uc9d1, pp.213-226, \uc11c\uc6b8 (1991.10).<\/li><\/ul>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4>Book Chapter<\/h4>\n\n\n\n<p><\/p>\n\n\n\n<ul><li><strong>S. Y. Chang<\/strong>,\u00a0<strong>H Hwang<\/strong>, K. Murty, &#8220;Optimizing the Radial Component Insertion Operations on PCBs&#8221;, Industrial Applications of Combinatorial Optimization, Applied optimizations series volume 16., Edited by Gang Yu, Vol.16, pp.125-141, Kluwer Academic Publisher (1998).<\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>To be updated International Journal Articles Woo-Lahm Kwak\u00a0and\u00a0Soo Y. Chang, &#8220;Order consolidation for hierarchical product lines&#8221;, Journal of Combinatorial Optimization, DOI: 10.1007\/s10878-012-9538-z, Springer (2012).\u00a0 Kyungkuk Lim, Kangbok Lee and\u00a0Soo Y. Chang, &#8220;Improved bounds for online scheduling with eligibilityconstraints&#8221;, Theoretical Computer Science, Vol.412, 5211-5224, Elsevier (2011).\u00a0 Junho Chang, Soo Y. Chang, [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":39,"menu_order":1,"comment_status":"closed","ping_status":"closed","template":"page-templates\/template-fullwidth.php","meta":[],"_links":{"self":[{"href":"https:\/\/chaos1.postech.ac.kr\/index.php\/wp-json\/wp\/v2\/pages\/82"}],"collection":[{"href":"https:\/\/chaos1.postech.ac.kr\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/chaos1.postech.ac.kr\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/chaos1.postech.ac.kr\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/chaos1.postech.ac.kr\/index.php\/wp-json\/wp\/v2\/comments?post=82"}],"version-history":[{"count":3,"href":"https:\/\/chaos1.postech.ac.kr\/index.php\/wp-json\/wp\/v2\/pages\/82\/revisions"}],"predecessor-version":[{"id":129,"href":"https:\/\/chaos1.postech.ac.kr\/index.php\/wp-json\/wp\/v2\/pages\/82\/revisions\/129"}],"up":[{"embeddable":true,"href":"https:\/\/chaos1.postech.ac.kr\/index.php\/wp-json\/wp\/v2\/pages\/39"}],"wp:attachment":[{"href":"https:\/\/chaos1.postech.ac.kr\/index.php\/wp-json\/wp\/v2\/media?parent=82"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}