[89] ģȯ°æ ¼±¹ÚÀÇ ÅõÀÚ ¹× ¿î¿µ ÅëÇÕ ÀÇ»ç°áÁ¤ ¸ðµ¨
ÀÌÁö¿¬, ¹®ÀÏ°æ
Çѱ¹SCMÇÐȸ Ãß°èÇмú´ëȸ, 2024.11.08, °í·Á´ëÇб³
[88] Dynamic Pricing and Energy Management for Shore Side Electricity in a Port Microgrid: A Deep Reinforcement Learning Approach
¿ÀÃæ±Ç, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2024.10.25, °úÇбâ¼úÄÁº¥¼Ç¼¾ÅÍ
[87] Dynamic Decision Making for Emission Reduction Measures in Maritime Voyages using Reinforcement Learning
ÀÌ´Ùºó, ÀÌÁØÇõ, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2024.10.25, °úÇбâ¼úÄÁº¥¼Ç¼¾ÅÍ
[86] Scenario-based stochastic programming for the maintenance scheduling of geographically distributed military radars
ÀÌ¿øÈ, ¹ÚÁؼ®, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2024.10.24, °úÇбâ¼úÄÁº¥¼Ç¼¾ÅÍ
[85] Efficient and Cost-Effective Bundle Generation using Heuristics and Multiprocessing
¹ÚÁؼ®, À̹ÎÈñ, ÃÖÀÇÇö
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2024.10.24, °úÇбâ¼úÄÁº¥¼Ç¼¾ÅÍ
[84] µÎ °³ÀÇ ¼·Î ´Ù¸¥ °ø±Þ¸Á¿¡¼ÀÇ °ø±Þ¸Á Áß´Ü ÀüÆĸ¦ °í·ÁÇÑ À§Çè ºÐ¼® ¸ðÇü
¿À¼¼¿ø, ¹®ÀÏ°æ
Çѱ¹SCMÇÐȸ Ãá°èÇмú´ëȸ, 2024.06.07, ´ëÇÑ»ó°øȸÀǼÒ
[83] Gaussian ³×Æ®¿öÅ©¸¦ ÀÌ¿ëÇÑ Ç×°ø Áö¿¬ ÀüÆÄ ¹× Áö¿¬ ÀÎÀÚ ºÐ¼®
±Ç¿µÁØ, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°èÇмú´ëȸ, 2024.05.03, ¿©¼ö ¿¢½ºÆ÷ ÄÁº¥¼Ç¼¾ÅÍ
[82] ¿¬·á °¡°ÝÀÇ ºÒÈ®½Ç¼º°ú ECA¸¦ °í·ÁÇÑ ¼±¹ÚÀÇ ¼Óµµ ¹× ±ÞÀ¯ Á¤Ã¥ µ¿½Ã ÃÖÀûÈ
¿©ÁøÇõ, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°èÇмú´ëȸ, 2024.05.03, ¿©¼ö ¿¢½ºÆ÷ ÄÁº¥¼Ç¼¾ÅÍ
[81] An Integrated Approach for Aircraft Routing and Fuel Tankering Problem
À¯Çý¹Î, ÀÌÁØÇõ, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2023.11.03, ¿ï»ê°úÇбâ¼ú¿ø
[80] Dynamic Pickup and Delivery Problem with External Demand for Autonomous Delivery Robots in Airport Terminal
Á¤ÁØÈ, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2023.11.03, ¿ï»ê°úÇбâ¼ú¿ø
[79] Aircraft Operations under the EU's Sustainable Aviation Fuel Policy
±¸¹ÎÁø, ±èµ¿¿í, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°èÇмú´ëȸ, 2023.06.01, Á¦ÁÖ ½ÅÈ¿ùµå ÄÁº¥¼Ç¼¾ÅÍ
[78] Airline Dynamic Pricing with Patient Customers Using Deep Exploration-Based Reinforcement Learning
Á¶¼º¹è, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2022.11.04, ÀÎõ´ëÇб³
[77] È¥ÇÕ °¡´É Á¦Ç°¿¡ ´ëÇÑ ¹°·ù ¼¾ÅÍ ¹× °ø±Þ¸Á ÃÖÀûÈ: Çѱ¹ »ç¾÷ÀåÆó±â¹° ó¸® »ê¾÷ »ç·Ê ¿¬±¸¸¦ ±â¹ÝÀ¸·Î
¿À¼¼¿ø, ¹®ÀÏ°æ
Çѱ¹SCMÇÐȸ Ãß°è°øµ¿Çмú´ëȸ, 2022.11.01, ´ëÇÑ»ó°øȸÀǼÒ
[76] È¥ÇÕ º¹Á¡ ½ÃÀå¿¡¼ÀÇ Àü±âÀÚµ¿Â÷ ÃæÀü¼Ò ÀÔÁö¼±Á¤ ¹®Á¦
¹ÚÁؼ®, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2022.06.02, Á¦ÁÖ ¶ó¸¶´ÙÇÁ¶óÀÚÈ£ÅÚ
[75] Áö»ó Áö¿¬ ÇÁ·Î±×·¥ ÇÏÀÇ ´ÙÁß °øÇ׿¡¼ Áö¿¬ ÀüÆĸ¦ °í·ÁÇÑ Ç×°ø»ç ¿î¿µ Ãø¸é Ç×°øÆí ÀçÁ¶Á¤
ÀÌÁö¿¬, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2022.06.02, Á¦ÁÖ ¶ó¸¶´ÙÇÁ¶óÀÚÈ£ÅÚ
[74] Clustered Vehicle Routing Problem for Waste Collection Using K-Means Ant Colony Optimization
±èÁ¤¹Î, °í⼺, ¹®ÀÏ°æ
Çѱ¹SCMÇÐȸ Ãá°èÇмú´ëȸ, 2022.04.19, ´ëÇÑ»ó°øȸÀǼÒ
[73] ½º¸¶Æ® ±×¸®µå¿¡¼ÀÇ Àü±â ÀÚµ¿Â÷ ÃæÀüÀ» À§ÇÑ ¸ÖƼ ¿¡ÀÌÀüÆ® ½ÉÃþ °ÈÇнÀ ±â¹Ý ½ºÄÉÁÙ¸µ
¹Ú°Ç¿ì, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2021.11.12, µ¿±¹´ëÇб³
[72] Military aircraft flight and maintenance planning model considering heterogeneous maintenance tasks
Â÷±Ô½Ä, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2021.11.12, µ¿±¹´ëÇб³
[71] È¿À²ÀûÀÎ Æó±â¹° °ü¸®¸¦ À§ÇÑ ½º¸¶Æ® ¾²·¹±âÅë ÇÒ´ç ¹× Â÷·® °æ·Î ¹®Á¦
±èÁ¤¹Î, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2021.11.12, µ¿±¹´ëÇб³
[70] Stochastic Programming Approach for the E-commerce Supply Chain Network Design with On-demand Warehousing System
ÀÌÁØÇõ, ¹®ÀÏ°æ
Çѱ¹SCMÇÐȸ Ãß°èÇмú´ëȸ, 2021.11.01, ´ëÇÑ»ó°øȸÀǼÒ
[69] Intelligent hybrid algorithm for solving a four dimensional traveling salesman problem
A. Roy, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2021.06.03, Á¦ÁÖ ±¹Á¦ÄÁº¥¼Ç¼¾ÅÍ
[68] Estimation of Cost Savings from Collaborations in the Physical Internet
±è¹ÎÁö, Â÷º´Ã¶, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2021.06.03, Á¦ÁÖ ±¹Á¦ÄÁº¥¼Ç¼¾ÅÍ
[67] ÇÇÅ©Àü·Â ÃÖ¼Òȸ¦ À§ÇÑ Àü·Â¼ö±Þ Àü·«°ú ¸¶ÀÌÅ©·Î±×¸®µå ÀÏÁ¤°èȹ ÃÖÀûÈ
¿ì¿µºó, ¹®ÀÏ°æ
Çѱ¹SCMÇÐȸ Ãá°èÇмú´ëȸ, 2021.05.28
[66] °ÈÇнÀÀ» ÀÌ¿ëÇÑ °øÇ× ÀÓ½ÃÆó¼â »óȲ¿¡¼ÀÇ Ç×°ø ÀÏÁ¤°èȹ º¹¿ø
ÀÌÁØÇõ, ÀÌ°æ½Ä, ¹®ÀÏ°æ
Çѱ¹SCMÇÐȸ Ãß°èÇмú´ëȸ, 2020.11.23, ´ëÇÑ»ó°øȸÀǼÒ
[65] ¿Â¶óÀÎ ±¤°í ÇÒ´ç ¹®Á¦¸¦ À§ÇÑ ±Ù»ç ¾Ë°í¸®Áò ¿¬±¸
±è±¤, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2020.11.13, ¼¿ï°úÇбâ¼ú´ëÇб³
[64] Strategic Bundling Approach for Gig Economy Operation of Electric Scooter Recharging
±è¹ÎÁ¤, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2020.11.13, ¼¿ï°úÇбâ¼ú´ëÇб³
[63] µÎ ´Ü°è Àç°í¸ðÇü ½Ã½ºÅÛ¿¡¼ÀÇ ÃÖÀû ¼¼ÀÏ ½ÃÁ¡ °áÁ¤ ¹®Á¦
½Å¿µÃ¶, °í⼺, ¹®ÀÏ°æ
Çѱ¹SCMÇÐȸ Ãß°èÇмú´ëȸ, 2019.12.06, ´ëÇÑ»ó°øȸÀǼÒ
[62] ÅÃ¹è ¼ºñ½º ³×Æ®¿öÅ© ¼³°è¸¦ À§ÇÑ ¼ö¸®Àû ¸ðÇü °³¹ß: H»ç »ç·Ê ¿¬±¸¸¦ Áß½ÉÀ¸·Î
±Ç¿µÁØ, °í⼺, ¹®ÀÏ°æ, Á¤º´µµ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2019.11.08, ¼¿ï´ëÇб³
[61] ¸ð¹ÙÀÏ ¾Û '³ª¸¸ÀÇ ³ÃÀå°í' 1+1 Çà»ç¸¦ °í·ÁÇÑ °°ÇÃÖÀûÈ º¹¼ö±â°£ Àç°í¸ðÇü
½Å¿µÃ¶, ÀÌ»óÀ±, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2019.11.08, ¼¿ï´ëÇб³
[60] Column Generation Approach for Dynamic Ridesharing Problem
±èÇö¿ì, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2019.11.08, ¼¿ï´ëÇб³
[59] Àç³ ¹ß»ý ÈÄÀÇ µµ·Î¼ö¸®ÆÀ ¹× ±¸È£¹°ÀÚº¸±ÞÂ÷·®ÀÇ ÅëÇÕ ½ºÄÉÁÙ¸µ ÃÖÀûÈ
½Å¿µÃ¶, ±è¼º¿ì, ¹®ÀÏ°æ
Çѱ¹SCMÇÐȸ Ãá°èÇмú´ëȸ, 2019.05.24, ´ëÇÑ»ó°øȸÀǼÒ
[58] Wasserstein °Å¸®¸¦ È°¿ëÇÑ ºÐÆ÷ °°Ç ½Å¹®°¡ÆÇ¿ø ¸ðÇü
ÀÌ»óÀ±, ±èÇö¿ì, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2019.04.11, ±¤ÁÖ ±è´ëÁßÄÁº¥¼Ç¼¾ÅÍ
[57] ÀÛ¾÷¹°ÀÇ ÅðÈ¿Í ÅðȺ¹±¸ÀÛ¾÷ÀÌ °í·ÁµÇ´Â ÀÏÁ¤°èȹ ¹®Á¦ÀÇ ºÐÁöÆò°¡¹ýÀ» ÀÌ¿ëÇÑ ÃÖÀûÈ ±â¹ý
¿ì¿µºó, ±èº´¼ö, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2019.04.11, ±¤ÁÖ ±è´ëÁßÄÁº¥¼Ç¼¾ÅÍ
[56] ¼±¹Ú°ú ³»·ú°£ÀÇ Å©·¹ÀÎ È°µ¿À» ÃÖ¼ÒÈÇϱâ À§ÇÑ ¼±¹Ú ÀûÀç °èȹ: Á¢ÀÌ½Ä ÄÁÅ×ÀÌ³Ê µµÀÔÀ» °í·ÁÇÏ¿©
±è¹Î¼ö, Á¤À±Á¦
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2019.04.11, ±¤ÁÖ ±è´ëÁßÄÁº¥¼Ç¼¾ÅÍ
[55] ±¤°íÈ¿°ú ÃÖ´ëȸ¦ À§ÇÑ ¿Â¶óÀÎ ¹è³Ê ±¤°í ÇÒ´ç ¹®Á¦
±è±¤, ±èµ¿¿í, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2019.04.11, ±¤ÁÖ ±è´ëÁßÄÁº¥¼Ç¼¾ÅÍ
[54] µå·ÐÀÇ ½Ç³» ÀÛ¾÷À» À§ÇÑ ½ºÄÉÁÙ¸µ ½Ã½ºÅÛ
¹Ú¿µ¼ö, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2018.05.06, °æÁÖ Çö´ëÈ£ÅÚ
[53] ÅÃ¹è °ÅÁ¡ ¿î¿µÀÇ ÀûÁ¤±Ô¸ð ¹× ±¸Á¶¿¡ ´ëÇÑ ¿¬±¸: Hub-and-Spoke¿Í Point-to-PointÀÇ È¥ÇÕ Àü·« ¹× °æÀï·Â ºÐ¼®
±è¼º¿ì, ÃÖ¼Çö, ±Ç¿µÁØ, ÀÌÁؼ·, °í½ÂÀ±, °í⼺, Á¤º´µµ, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2018.05.06, °æÁÖ Çö´ëÈ£ÅÚ
[52] º¯ÈÇÏ´Â Àç³ »óȲÀ» ¹Ý¿µÇÑ ¼ö¸® Àη ½ºÄÉÁÙ¸µ
±è¼º¿ì, ½Å¿µÃ¶, ¹®ÀÏ°æ
Çѱ¹SCMÇÐȸ Ãß°èÇмú´ëȸ, 2017.11.16, ´ëÇÑ»ó°øȸÀǼÒ
[51] A Study on the Distribution Robust Solution Methods for the Newsvendor Problem under Demand Uncertainty
ÃÖ¼Çö, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2017.11.04, KAIST
[50] Robust Empty Container Repositioning Considering Foldable Containers
ÀÌ»óÀ±, ¹®ÀÏ°æ
°æ¿µ°úÇÐȸ Ãß°èÇмú´ëȸ, 2017.10.27, ¼°´ëÇб³
[49] 4Â÷ »ê¾÷Çõ¸í¿¡ ¸ÂÃá »ý»ê ¹× Á¦Á¶°ü·Ã ±³°ú¸ñ ¹ßÀü ¹æÇâ
¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2017.04.27, ¿©¼ö¿¢½ºÆ÷ÄÁº¥¼Ç¼¾ÅÍ
[48] Àç³ ÀÌÈÄ Ãʱ⠴ëÀÀÀ» À§ÇÑ ÁøÀÔ ¸ðµ¨ ¹× ¾Ë°í¸®Áò
±è¼º¿ì, ½Å¿µÃ¶, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2017.04.27, ¿©¼ö¿¢½ºÆ÷ÄÁº¥¼Ç¼¾ÅÍ
[47] Joint Decisions on Product Line Selection, Purchasing, and Pricing
¹®ÀÏ°æ, ÇÏ¿À¡, ¹Ú°Ç¼ö
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2016.04.15, Á¦ÁÖÄÁº¥¼Ç¼¾ÅÍ(ICC)
[46] ¹°·ù ¹× °ø±Þ¸Á°ü¸® ¿öÅ·±×·ì ¼Ò°³
¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2014.11.22, °æ±â´ëÇб³ ¼ö¿øÄ·ÆÛ½º
[45] Planning of business process execution in BPM environments
¹èÇý¸², ÀÌ»óÇù, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ/Çѱ¹°æ¿µ°úÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2014.5.16~5.17, ºÎ»ê º¤½ºÄÚ(BEXCO)
[44] ÇØ¿î¹°·ù : ¿¬±¸ÀÇ ºí·ç¿À¼Ç
¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2013.11.15, ¼º±Õ°ü´ëÇб³ ÀÚ¿¬°úÇÐÄ·ÆÛ½º(¼ö¿ø)
[43] Ç¥ÁØ ¹× Á¢ÀÌ½Ä ÄÁÅ×À̳ʸ¦ »ç¿ëÇÑ ÃÖÀû °øÄÁÅ×À̳ʰü¸®
µµÀÀ¿Á¾ÈµÕ, ¹®ÀÏ°æ, Rob Konings
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°èÇмú´ëȸ, 2013.5.24~5.25, µð¿À¼Ç¸®Á¶Æ®
[42] Å×½ºÆ®-º£µå ÀÏÁ¤°èȹÀ» À§ÇÑ ¼ö¸®¸ðÇü ¹× È¥ÇÕ À¯ÀüÀÚ ¾Ë°í¸®Áò °³¹ß
µµÀÀ¿Á¾ÈµÕ, À̼öÇå, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°èÇмú´ëȸ, 2012.05.11, °æÁÖÇö´ëÈ£ÅÚ
[41] Robust Multiple Depot Multiple Travelling Salesmen Problem with Travel Time Uncertainty
¹®ÀÏ°æ, Ä¡¿þÀÌ
´ëÇÑ»ê¾÷°øÇÐȸ Ãá°èÇмú´ëȸ, 2012.05.11, °æÁÖÇö´ëÈ£ÅÚ
[40] Container Packing Problem with Balance Constrains
ÀÀÀ¢Æ¼ ºñ¿¡Æ® ¸®,¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2011.11.05, ¼þ½Ç´ëÇб³
[39] ÀÏ¹Ý ¹× Á¢ÀÌ½Ä ÄÁÅ×À̳ʸ¦ µ¿½Ã¿¡ »ç¿ëÇÑ °ø ÄÁÅ×ÀÌ³Ê Àç¹èÄ¡
È«ÈÁø,¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Ãß°èÇмú´ëȸ, 2011.11.05, ¼þ½Ç´ëÇб³
[38] A New Packing Strategy for a Three-demensional Bin Packing Problem Using a Hybrid Genetic Algorithm
°°æµµ,¹®ÀÏ°æ
Çѱ¹ SCM Ãá°è¹ßÇ¥´ëȸ, 2011.6.08, Çѱ¹°úÇбâ¼úȸ°ü
[37] Revenue Sharing Contract Considering Time Value of Money
dz¼³È£,¹®ÀÏ°æ,·ù±¤¿
Çѱ¹ SCM Ãá°è¹ßÇ¥´ëȸ, 2011.6.08, Çѱ¹°úÇбâ¼úȸ°ü
[36] ŸºÎ¼Ä¡ ¾Ë°í¸®ÁòÀ» ÀÌ¿ëÇÑ Á¶¼± ¾ßµå ÀûÄ¡ÀåÀÇ ºí·Ï ¹ÝÃâ °èȹ
ÀÌ»óÇù,±èÁö¿Â,¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ/Çѱ¹°æ¿µ°úÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2011.5.27, ¼ÛµµÄÁº¥½Ã¾Æ
[35] Hybrid Genetic Algorithm for the Multiple Container Packing Problem
½ÅÁ¤È£,dz¼³È£,¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ/Çѱ¹°æ¿µ°úÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2011.5.26, ¼ÛµµÄÁº¥½Ã¾Æ
[34] º¯µ¿ »ý»ê¿ë·®ÇÏÀÇ Àç°í°ü¸® ½Ã½ºÅÛ
¹®ÀÏ°æ, ÇϺ´Çö, ±èÁ¾Ã¶
´ëÇÑ»ê¾÷°øÇÐȸ Çмú´ëȸ, 2010.11.06, µ¿±¹´ëÇб³
[33] Supply Chain Coordination with Revenue Sharing Contracts
dz¼³È£, ¹®ÀÏ°æ, ·ù±¤¿, ±Çº¸¹è
´ëÇÑ»ê¾÷°øÇÐȸ/Çѱ¹°æ¿µ°úÇÐȸ Ãá°è°øµ¿Çмú´ëȸ, 2010.06.04, ¶ó¸¶´ÙÇÁ¶óÀÚÁ¦ÁÖÈ£ÅÚ
[32] Development of the Empty Container Simulation Game
°íÁ¤ºÐ, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Çмú´ëȸ, 2009.10.09, °æÈñ´ëÇб³
[31] Multi-Depot Vehicle Routing Problem with Delivery and Installation Vehicles
¹®ÀÏ°æ, ¹èÈñö
´ëÇÑ»ê¾÷°øÇÐȸ Çмú´ëȸ, 2009.10.09, °æÈñ´ëÇб³
[30] Capacity Expansion Problem of Container Terminal
¹®ÀÏ°æ, Do Ngoc Anh-Dung
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 2009.05.22, ºÎ»ê´ëÇб³
[29] ÄÁÅ×À̳ʼ±ÀÇ °æ·Î¸¦ °í·ÁÇÑ °ø ÄÁÅ×ÀÌ³Ê ¹è¼Û ¹®Á¦¿¡ °üÇÑ ¿¬±¸
½Å»óÈÆ, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Çмú´ëȸ, 2008.11.08, ÇѾç´ëÇб³
[28] °ø ÄÁÅ×ÀÌ³Ê °ü¸®¸¦ À§ÇÑ ÇØ»ó¿î¼Û ³×Æ®¿öÅ© ¼³°è ¹× ¿î¿µ¿¡ °üÇÑ ¿¬±¸
¹®ÀÏ°æ, Do Ngoc Anh-Dung, ¹èÈñö
´ëÇÑ»ê¾÷°øÇÐȸ/Çѱ¹°æ¿µ°úÇÐȸ °øµ¿Çмú´ëȸ, 2008.05.16~17, Æ÷Ç×°ø°ú´ëÇб³
[27] ÇØ»ó¿î¼ÛÀ» °í·ÁÇÑ °ø ÄÁÅ×ÀÌ³Ê Àç¹èÄ¡¿¡ °üÇÑ ¿¬±¸
¹èÈñö, ¹®ÀÏ°æ
Çѱ¹Ç×ÇØÇ׸¸ÇÐȸ Çмú´ëȸ, 2007.12.06, µ¿¾Æ´ëÇб³
[26] ÀÚ¿øÁ¦¾àÀ» °í·ÁÇÑ ÅëÇÕµÈ Á¶¸³¶óÀÎ ¹ë·±½Ì¿¡ ´ëÇÑ ¿¬±¸
¹®ÀÏ°æ, ¼º ÁØ
´ëÇÑ»ê¾÷°øÇÐȸ Çмú´ëȸ, 2007.11.03, °Ç±¹´ëÇб³
[25] º¹¼öÀÇ ÀçÈ°¿ë ºÎÇ°À» °í·ÁÇÑ ÀçÈ°¿ë ¹× ±¸¸ÅÁ¤Ã¥
½ÉÀç¿ë, ¹®ÀÏ°æ, E.Silver
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 2006.5.19~5.20, KAIST
[24] ¿ÜÁÖÂ÷·®À» °í·ÁÇÑ ½Ã°£Á¦¾àÀÌ ÀÖ´Â Â÷·®°æ·Î¹®Á¦¿¡ ´ëÇÑ ¿¬±¸
¼ºÁØ, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Çмú´ëȸ, 2005.11.25, ¿¬¼¼´ëÇб³, pp. 744~752
[23] °ø±Þ»ç½½¿¡¼ÀÇ ´ÙÇ°¸ñ ÀÏ°ý±¸¸ÅÀü·«
¹®ÀÏ°æ, Â÷º´Ã¶
Çѱ¹SCMÇÐȸ Çмú´ëȸ, 2005.6.11, µ¿±¹´ëÇб³, pp. 409~431
[22] ±×·ì Å×Å©³î·ÎÁö °æÁ¦Àû ·ÎÆ® ÀÏÁ¤°èȹ¹®Á¦¸¦ À§ÇÑ º¹ÇÕ À¯ÀüÀÚ ¾Ë°í¸®Áò
¹®ÀÏ°æ, Â÷º´Ã¶, ¹èÈñö
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 2005.5.13~5.14, ÃæºÏ´ëÇб³, pp. 947~951
[21] °ø±Þ»ç½½¿¡¼ ´ÙÇ°¸ñ ÀÏ°ý±¸¸Å ¹× Á¶´ÞÀÏÁ¤°èȹ¿¡ °üÇÑ ¿¬±¸
Â÷º´Ã¶, ¹®ÀÏ°æ
´ëÇÑ»ê¾÷°øÇÐȸ Çмú´ëȸ, 2004.11.13, ¼¿ï´ëÇб³
[20] Á¦¾à½ÄÀ» °í·ÁÇÑ ´ÙÇ°¸ñ ÀÏ°ýÁÖ¹®¸ðÇü¿¡ °üÇÑ ¿¬±¸
Â÷º´Ã¶, ¹®ÀÏ°æ
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 2004.5.21~5.22, ÀüºÏ´ëÇб³
[19] È¥ÇÕÁ¤¼ö°èȹ¹ý ¹× À¯ÀüÀÚ ¾Ë°í¸®ÁòÀ» ÀÌ¿ëÇÑ ´ÙÇ°¸ñ Àç°í ½Ã½ºÅÛÀÇ ÁÖ¹® Áֱ⠻ó¼â¿¡ °üÇÑ ¿¬±¸
¹®ÀÏ°æ, Â÷º´Ã¶, ±è¼±±Ç
Çѱ¹°æ¿µ°úÇÐȸ Çмú´ëȸ, 2003.11.1, ±¹¹Î´ëÇб³, pp. 81~84
[18] Á߼ҽŹ߻ý»ê±â¾÷À» À§ÇÑ »ý»êÁ¤º¸½Ã½ºÅÛ °³¹ß
ÀÌ°æ±Ù, À±¿ø¿µ, ¹®ÀÏ°æ, Á¶Çü¼ö, Â÷º´Ã¶
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 2003.5.16~5.17, Çѵ¿´ëÇб³
[17] Á߼ҽŹ߻ý»ê±â¾÷ÀÇ »ý»ê½Ã½ºÅÛ °³¼±À» À§ÇÑ ½Ã¹Ä·¹ÀÌ¼Ç ¸ðÇü °³¹ß¿¡ ´ëÇÑ ¿¬±¸
ÀÌ°æ±Ù, À±¿ø¿µ, ¹®ÀÏ°æ, Á¶Çü¼ö, Â÷º´Ã¶
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 2003.5.16~5.17, Çѵ¿´ëÇб³
[16] ¼ö·® ÇÒÀÎÀÌ ÀÖ´Â È®·üÀû Àç°í ¸ðÇü¿¡¼ÀÇ Á¶´Þ±â°£ÀÇ ´ÜÃà
¹®ÀÏ°æ, ±èÅ¿µ
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 2002.5.3~5.4, Çѱ¹°úÇбâ¼ú¿ø
[15] ¾ÇȵǴ »ý»ê½Ã½ºÅÛ¿¡¼ÀÇ °æÁ¦Àû ·ÎÆ® ÀÏÁ¤°èȹ
¹®ÀÏ°æ, B.C.Giri, À±¿ø¿µ
´ëÇÑ»ê¾÷°øÇÐȸ Çмú´ëȸ, 2001.11.3, ¸íÁö´ëÇб³
[14] ºÒ¿ÏÀüÇÑ »ý»ê °úÁ¤ÇÏ¿¡¼ÀÇ °æÁ¦Àû ·ÎÆ® ÀÏÁ¤°èȹ ¹®Á¦
ÃÖ±âÀÏ, ¹®ÀÏ°æ, B.C.Giri
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 2001.4.27~4.28, °üµ¿´ëÇб³
[13] º¹ÇÕ À¯ÀüÀÚ ¾Ë°í¸®ÁòÀ» ÀÌ¿ëÇÑ °æÁ¦Àû ·ÎÆ® ÀÏÁ¤°èȹ ¹®Á¦
¹®ÀÏ°æ, ÃÖ»óÁø
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 2000.4.21~4.22, °æ³²´ëÇб³, pp. 111~117
[12] A Fast Heuristic for Minimizing Total Average Cycle Stock Subject to Practical Constraints
I.Moon and E.Silver
´ëÇÑ»ê¾÷°øÇÐȸ Çмú´ëȸ, 1999.10.30, ¼¿ï´ëÇб³, pp. 1004
[11] È®·üÀû Á¦Ç°¼ö¸íÁֱ⸦ °®´Â °æÁ¦ÀûÁÖ¹®·®¸ðÇü¿¡ ÀÎÇ÷¹À̼ǰú µ·ÀÇ ½Ã°£Àû °¡Ä¡°¡ ¹ÌÄ¡´Â ¿µÇâ
¹®ÀÏ°æ, À̼ö¿¬
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 1998.4.24~4.25, °æ¼º´ëÇб³
[10] ¿¬¼ÓÁ¶»ç Àç°í¸ðÇü¿¡¼ Á¶´Þ±â°£ ´ÜÃàÀÇ È¿°ú¿¡ °üÇÑ ¿¬±¸
¹®ÀÏ°æ, ÃÖ»óÁø
´ëÇÑ»ê¾÷°øÇÐȸ Çмú´ëȸ, 1997.10.25, ÀÎÇÏ´ëÇб³
[9] ÇÁ·£Æ® °øÀå ÅëÇÕ»ý»ê°ü¸®½Ã½ºÅÛ °³¹ß »ç·Ê
¹®ÀÏ°æ, ÃÖ»óÁø, À̼ö¿¬, ÀÌÁ¾Çõ
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 1997.4.25~4.26, Æ÷Ç×°ø°ú´ëÇб³
[8] »ê¾÷°øÇÐ ¿¬±¸¿¡ÀÇ World Wide WebÀÇ È°¿ë
¹®ÀÏ°æ, ÃÖ»óÁø
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 1996.4.26~4.27, °ø±º»ç°üÇб³
[7] ¾ÈÁ¤È ±â°£À» °í·ÁÇÑ Economic Lot Scheduling Problem
¹®ÀÏ°æ, ÀÌö
´ëÇÑ»ê¾÷°øÇÐȸ Çмú´ëȸ, 1995.10.20, °æÈñ´ëÇб³ ¼ö¿ø°·ÆÛ½º
[6] FMS¿¡¼ ´ë¾È±â°è¸¦ °í·ÁÇÑ Job Shop ½ºÄÉÁ층
¹®ÀÏ°æ, ÀÌ»óÇù
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 1995.4.28~4.29, Àü³²´ëÇб³
[5] Generalized Formula for Periodic Geometric-gradient-series Payment in a Skip Payment Loan with Arbitrary Skips
¹®ÀÏ°æ
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 1994.4.8~4.9, â¿ø´ëÇб³
[4] °¡°ø, Á¶¸³ µ¿±âȸ¦ À§ÇÑ ½Ã¹Ä·¹À̼Ç
Á¶±Ô°©, À±¿ø¿µ, ¹®ÀÏ°æ, ±è¿µ±Ô, ±èÁ¤È£, ¼ºÀç±â
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 1994.4.8~4.9, â¿ø´ëÇб³
[3] Multiproduct Economic Lost¡¤Size Models with Investment Costs for Setup Reduction and Quality Improvement: Review and Extention
¹®ÀÏ°æ
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 1994.4.8~4.9, â¿ø´ëÇб³
[2] ºÐÆ÷ÀÚÀ¯ Á¢±Ù¹æ¹ýÀÇ »ý»ê Àç°í ½Ã½ºÅÛ¿¡ÀÇ Àû¿ë
¹®ÀÏ°æ, ÃÖ»óÁø
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 1994.4.8~4.9, â¿ø´ëÇб³
[1] Just-in-Time Application in the Economic Lot Scheduling Problem
¹®ÀÏ°æ
Çѱ¹°æ¿µ°úÇÐȸ/´ëÇÑ»ê¾÷°øÇÐȸ °øµ¿Çмú´ëȸ, 1992.5.1~5.2, ¿ï»ê´ëÇб³
|