{"id":992,"date":"2023-12-18T08:32:05","date_gmt":"2023-12-18T08:32:05","guid":{"rendered":"https:\/\/iim.nycu.edu.tw\/?page_id=992"},"modified":"2026-04-11T10:41:05","modified_gmt":"2026-04-11T10:41:05","slug":"lin-miao-tsung","status":"publish","type":"page","link":"https:\/\/iim.nycu.edu.tw\/en\/teacher\/lin-miao-tsung","title":{"rendered":"Lin, Bertrand M.T."},"content":{"rendered":"<div class=\"wp-block-group alignfull has-palette-color-5-background-color has-background is-layout-constrained wp-container-core-group-is-layout-4d477f34 wp-block-group-is-layout-constrained wp-container-1 is-position-sticky\" style=\"border-radius:5px;margin-top:0;margin-bottom:0;padding-top:var(--wp--preset--spacing--30);padding-right:0;padding-bottom:var(--wp--preset--spacing--30);padding-left:0\">\n<div class=\"wp-block-columns is-layout-flex wp-container-core-columns-is-layout-28f84493 wp-block-columns-is-layout-flex\">\n<div class=\"wp-block-column is-vertically-aligned-center is-layout-flow wp-block-column-is-layout-flow\">\n<h3 class=\"wp-block-heading\">Lin, Bertrand M.T.<\/h3>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-vertically-aligned-bottom is-layout-flow wp-block-column-is-layout-flow\">\n<p class=\"has-text-align-right has-link-color wp-elements-aced355b3b7588503e766416235696b2\"><a href=\"https:\/\/iim.nycu.edu.tw\/en\/faculty\/all\/\" title=\"Faculty Members\">Faculty<\/a> \/ <a href=\"https:\/\/iim.nycu.edu.tw\/en\/faculty\/all\/#professors\" title=\"Faculty Members\">Faculty Members<\/a><\/p>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n<div class=\"wp-block-group alignwide has-palette-color-6-background-color has-background is-layout-constrained wp-container-core-group-is-layout-592f268c wp-block-group-is-layout-constrained\" style=\"border-radius:5px;margin-top:0;margin-bottom:0;padding-top:var(--wp--preset--spacing--50);padding-right:var(--wp--preset--spacing--70);padding-bottom:var(--wp--preset--spacing--50);padding-left:var(--wp--preset--spacing--70)\">\n<div class=\"wp-block-uagb-buttons uagb-buttons__outer-wrap uagb-btn__default-btn uagb-btn-tablet__default-btn uagb-btn-mobile__default-btn uagb-block-bb1401d6\"><div class=\"uagb-buttons__wrap uagb-buttons-layout-wrap\">\n<div class=\"wp-block-uagb-buttons-child uagb-buttons__outer-wrap uagb-block-989d72c3 wp-block-button\"><div class=\"uagb-button__wrapper\"><a class=\"uagb-buttons-repeater wp-block-button__link\" aria-label=\"\" href=\"https:\/\/iim.nycu.edu.tw\/en\/teacher\/Chen-Po-An\/\" rel=\"follow noopener\" target=\"_self\" role=\"button\"><div class=\"uagb-button__link\">Chen, Po-An<\/div><\/a><\/div><\/div>\n\n\n\n<div class=\"wp-block-uagb-buttons-child uagb-buttons__outer-wrap uagb-block-36c53abd wp-block-button\"><div class=\"uagb-button__wrapper\"><a class=\"uagb-buttons-repeater wp-block-button__link\" aria-label=\"\" href=\"https:\/\/iim.nycu.edu.tw\/en\/teacher\/Liu-Duen-Ren\/\" rel=\"follow noopener\" target=\"_self\" role=\"button\"><div class=\"uagb-button__link\">Liu, Duen-Ren<\/div><\/a><\/div><\/div>\n\n\n\n<div class=\"wp-block-uagb-buttons-child uagb-buttons__outer-wrap uagb-block-2eed99c2 wp-block-button\"><div class=\"uagb-button__wrapper\"><a class=\"uagb-buttons-repeater wp-block-button__link\" aria-label=\"\" href=\"https:\/\/iim.nycu.edu.tw\/en\/teacher\/Tsai-Min-Jen\/\" rel=\"follow noopener\" target=\"_self\" role=\"button\"><div class=\"uagb-button__link\">Tsai, Min-Jen<\/div><\/a><\/div><\/div>\n\n\n\n<div class=\"wp-block-uagb-buttons-child uagb-buttons__outer-wrap uagb-block-ccf4151b wp-block-button\"><div class=\"uagb-button__wrapper\"><a class=\"uagb-buttons-repeater wp-block-button__link\" aria-label=\"\" href=\"#\" rel=\"follow noopener\" target=\"_self\" role=\"button\"><div class=\"uagb-button__link\">Lin, Bertrand M.T.<\/div><\/a><\/div><\/div>\n\n\n\n<div class=\"wp-block-uagb-buttons-child uagb-buttons__outer-wrap uagb-block-2f758b70 wp-block-button\"><div class=\"uagb-button__wrapper\"><a class=\"uagb-buttons-repeater wp-block-button__link\" aria-label=\"\" href=\"https:\/\/iim.nycu.edu.tw\/en\/teacher\/Li-Yung-Ming\/\" rel=\"follow noopener\" target=\"_self\" role=\"button\"><div class=\"uagb-button__link\">Li, Yung-Ming<\/div><\/a><\/div><\/div>\n\n\n\n<div class=\"wp-block-uagb-buttons-child uagb-buttons__outer-wrap uagb-block-89f01295 wp-block-button\"><div class=\"uagb-button__wrapper\"><a class=\"uagb-buttons-repeater wp-block-button__link\" aria-label=\"\" href=\"https:\/\/iim.nycu.edu.tw\/en\/teacher\/Ku-Cheng-Yuan\/\" rel=\"follow noopener\" target=\"_self\" role=\"button\"><div class=\"uagb-button__link\">Ku, Cheng-Yuan<\/div><\/a><\/div><\/div>\n\n\n\n<div class=\"wp-block-uagb-buttons-child uagb-buttons__outer-wrap uagb-block-5a1aa5e7 wp-block-button\"><div class=\"uagb-button__wrapper\"><a class=\"uagb-buttons-repeater wp-block-button__link\" aria-label=\"\" href=\"https:\/\/iim.nycu.edu.tw\/en\/teacher\/Chuang-Yung-Ting\/\" rel=\"follow noopener\" target=\"_self\" role=\"button\"><div class=\"uagb-button__link\">Chuang, Yung-Ting<\/div><\/a><\/div><\/div>\n<\/div><\/div>\n\n\n\n<div class=\"wp-block-columns is-layout-flex wp-container-core-columns-is-layout-402b6bc0 wp-block-columns-is-layout-flex\" style=\"padding-top:var(--wp--preset--spacing--50);padding-right:var(--wp--preset--spacing--80);padding-bottom:var(--wp--preset--spacing--50);padding-left:var(--wp--preset--spacing--80)\">\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\" style=\"flex-basis:30%\">\n<figure class=\"wp-block-image alignright size-full is-resized\"><img fetchpriority=\"high\" decoding=\"async\" width=\"393\" height=\"394\" src=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/\u6797\u5999\u8070.png\" alt=\"\" class=\"wp-image-1434\" style=\"width:207px;height:auto\" srcset=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/\u6797\u5999\u8070.png 393w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/\u6797\u5999\u8070-300x300.png 300w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/\u6797\u5999\u8070-150x150.png 150w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/\u6797\u5999\u8070-200x201.png 200w\" sizes=\"(max-width: 393px) 100vw, 393px\" \/><\/figure>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\" style=\"flex-basis:70%\">\n<div class=\"wp-block-columns is-layout-flex wp-container-core-columns-is-layout-28f84493 wp-block-columns-is-layout-flex\">\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\" style=\"flex-basis:30%\">\n<h1 class=\"wp-block-heading has-text-align-left has-palette-color-4-color has-text-color has-link-color wp-elements-9ee04ba6b4e65385d8db37fe01564bb9\">Lin, Bertrand M.T.<\/h1>\n\n\n\n<pre class=\"wp-block-preformatted\">Laboratory on-campus extension email laboratory personal website<\/pre>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\" style=\"flex-basis:70%\">\n<h1 class=\"wp-block-heading has-text-align-left has-palette-color-4-color has-text-color has-link-color wp-elements-55846ac0c6e371ac62a9e80748de8e59\">Professor<\/h1>\n\n\n\n<pre class=\"wp-block-preformatted\" style=\"padding-right:0;padding-left:0\">Management Hall 2 MB310<br>57410, 31472<br>bmtlin@nycu.edu.tw<br>Optimization Theory and Applications Lab<br><a href=\"https:\/\/bmtlin.lab.nycu.edu.tw\/\" target=\"_blank\" rel=\"noopener\" title=\"\">LINK<\/a><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n<div class=\"wp-block-columns are-vertically-aligned-top has-palette-color-7-background-color has-background is-layout-flex wp-container-core-columns-is-layout-5243a9a1 wp-block-columns-is-layout-flex\" style=\"margin-top:0;margin-bottom:0;padding-top:var(--wp--preset--spacing--30);padding-right:var(--wp--preset--spacing--80);padding-bottom:var(--wp--preset--spacing--30);padding-left:var(--wp--preset--spacing--80)\">\n<div class=\"wp-block-column is-vertically-aligned-top is-layout-flow wp-block-column-is-layout-flow\">\n<h5 class=\"wp-block-heading has-text-align-center\"><strong>Optimization Theory and Applications Lab<\/strong><\/h5>\n\n\n\n<p class=\"has-text-align-center has-medium-font-size\">Office: MB313B, Management Building 2<br>Extension: 57419<\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-vertically-aligned-top is-layout-flow wp-block-column-is-layout-flow\">\n<h5 class=\"wp-block-heading has-text-align-center\"><strong>Research<\/strong><\/h5>\n\n\n\n<p class=\"has-text-align-center has-medium-font-size\">Scheduling Theory<br>Operations Management<br>Discrete Optimization<\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-vertically-aligned-top is-layout-flow wp-block-column-is-layout-flow\">\n<h5 class=\"wp-block-heading has-text-align-center\"><strong>Courses<\/strong><\/h5>\n\n\n\n<p class=\"has-text-align-center has-medium-font-size\">Scheduling Theory and Applications<br>Advanced Computer Algorithms<br>Algorithms<br>Data Structure<\/p>\n<\/div>\n<\/div>\n\n\n\n<div class=\"wp-block-getwid-tabs\" data-active-tab=\"0\"><ul class=\"wp-block-getwid-tabs__nav-links\"><\/ul>\n<div class=\"wp-block-getwid-tabs__nav-link\"><span class=\"wp-block-getwid-tabs__title-wrapper\"><a href=\"#\"><span class=\"wp-block-getwid-tabs__title\">Research areas and major experiences<\/span><\/a><\/span><\/div><div class=\"wp-block-getwid-tabs__tab-content-wrapper\"><div class=\"wp-block-getwid-tabs__tab-content\">\n<table id=\"tablepress-31\" class=\"tablepress tablepress-id-31\">\n<thead>\n<tr class=\"row-1\">\n\t<th class=\"column-1\">Academic Background<\/th>\n<\/tr>\n<\/thead>\n<tbody class=\"row-striping row-hover\">\n<tr class=\"row-2\">\n\t<td class=\"column-1\">PhD, Department of Information Engineering, National Chiao Tung University<\/td>\n<\/tr>\n<tr class=\"row-3\">\n\t<td class=\"column-1\">Department of Information Science, National Chiao Tung University<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<!-- #tablepress-31 from cache -->\n\n\n<table id=\"tablepress-32\" class=\"tablepress tablepress-id-32\">\n<thead>\n<tr class=\"row-1\">\n\t<th class=\"column-1\">Curriculum Vitae<\/th><th class=\"column-2\">A visiting scholar<\/th><th class=\"column-3\">Visiting professor<\/th><th class=\"column-4\">Senior Research Fellow<\/th><th class=\"column-5\">Journal editing services<\/th><th class=\"column-6\">Resign<\/th>\n<\/tr>\n<\/thead>\n<tbody class=\"row-striping row-hover\">\n<tr class=\"row-2\">\n\t<td class=\"column-1\">Director, Institute of Information Management, National Chiao Tung University<\/td><td class=\"column-2\">Department of Industrial &amp; Operations Engineering, University of Michigan<\/td><td class=\"column-3\">Faculty of Physical and Mathematical Sciences, University of Technology Sydney<\/td><td class=\"column-4\">Department of Management, The Hong Kong Polytechnic University<\/td><td class=\"column-5\">Area editor, NTU Management Review NTU Management Review (12\/2022~)<\/td><td class=\"column-6\">Area editor, Sun Yat-Sen Management ReviewZhongshan Management Review(01\/2017~07\/2019)<\/td>\n<\/tr>\n<tr class=\"row-3\">\n\t<td class=\"column-1\">Professor, Department of Information Management and Finance, National Chiao Tung University<\/td><td class=\"column-2\">Department of Computer Science, NJIT<\/td><td class=\"column-3\">Warwick Business School, Warwick University<\/td><td class=\"column-4\"><\/td><td class=\"column-5\">Associate editor, Asia-Pacific Journal of Operational Research (09\/2008~)<\/td><td class=\"column-6\">Editorial board member, International Journal of Production Economics (04\/2008~02\/2021)<\/td>\n<\/tr>\n<tr class=\"row-4\">\n\t<td class=\"column-1\">Professor and Head of Department of Information Management, National Jinan University<\/td><td class=\"column-2\">Sobolev of Mathematics, Russian Academy of Sciences<\/td><td class=\"column-3\"><\/td><td class=\"column-4\"><\/td><td class=\"column-5\">Associate editor, Journal of Industrial and Management Optimization (04\/2011~)<\/td><td class=\"column-6\">Editorial advisory board member, Computers and Operations Research (01\/2006~09\/2019)<\/td>\n<\/tr>\n<tr class=\"row-5\">\n\t<td class=\"column-1\">Professor and Head of Department of Information Science, Mingchuan University<\/td><td class=\"column-2\">IBM TJ Watson Research Center, NY<\/td><td class=\"column-3\"><\/td><td class=\"column-4\"><\/td><td class=\"column-5\">Associate editor, Journal of Scheduling (02\/2012-)<\/td><td class=\"column-6\">Editorial board member, International Journal of Operations Research (05\/2004~10\/2008)<\/td>\n<\/tr>\n<tr class=\"row-6\">\n\t<td class=\"column-1\">Associate Professor, Department of Information Management, Ming Chuan University<\/td><td class=\"column-2\"><\/td><td class=\"column-3\"><\/td><td class=\"column-4\"><\/td><td class=\"column-5\">Area Editor, Computers &amp; Industrial Engineering (05\/2020~)<\/td><td class=\"column-6\"><\/td>\n<\/tr>\n<tr class=\"row-7\">\n\t<td class=\"column-1\"><\/td><td class=\"column-2\"><\/td><td class=\"column-3\"><\/td><td class=\"column-4\"><\/td><td class=\"column-5\">Editorial board member, Journal of Applied and Industrial Mathematics, affiliated with Discrete Analysis and Operations Research in Russian (10\/2015~)<\/td><td class=\"column-6\"><\/td>\n<\/tr>\n<tr class=\"row-8\">\n\t<td class=\"column-1\"><\/td><td class=\"column-2\"><\/td><td class=\"column-3\"><\/td><td class=\"column-4\"><\/td><td class=\"column-5\">Editorial board member, Social Sciences &amp; Humanities Open (10\/2018~)<\/td><td class=\"column-6\"><\/td>\n<\/tr>\n<tr class=\"row-9\">\n\t<td class=\"column-1\"><\/td><td class=\"column-2\"><\/td><td class=\"column-3\"><\/td><td class=\"column-4\"><\/td><td class=\"column-5\">Editorial board member, International Journal of Planning and Scheduling (09\/2009~)<\/td><td class=\"column-6\"><\/td>\n<\/tr>\n<tr class=\"row-10\">\n\t<td class=\"column-1\"><\/td><td class=\"column-2\"><\/td><td class=\"column-3\"><\/td><td class=\"column-4\"><\/td><td class=\"column-5\">Editorial review board member, International Journal of Applied Metaheuristic Computing (11\/2008~)<\/td><td class=\"column-6\"><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<!-- #tablepress-32 from cache --><\/div><\/div>\n\n\n\n<div class=\"wp-block-getwid-tabs__nav-link\"><span class=\"wp-block-getwid-tabs__title-wrapper\"><a href=\"#\"><span class=\"wp-block-getwid-tabs__title\">Papers and Books<\/span><\/a><\/span><\/div><div class=\"wp-block-getwid-tabs__tab-content-wrapper\"><div class=\"wp-block-getwid-tabs__tab-content\">\n<table id=\"tablepress-33\" class=\"tablepress tablepress-id-33\">\n<thead>\n<tr class=\"row-1\">\n\t<th class=\"column-1\">Journal Paper<\/th>\n<\/tr>\n<\/thead>\n<tbody class=\"row-striping row-hover\">\n<tr class=\"row-2\">\n\t<td class=\"column-1\">Huang, C.T., Hsieh, T.J. &amp; Lin*, B.M.T. (2024). Data-driven scheduling for the photolithography process in semiconductor manufacturing. Accepted by Journal of Industrial and Management Optimization.<\/td>\n<\/tr>\n<tr class=\"row-3\">\n\t<td class=\"column-1\">Zinder, Y., Berlinska*, J. &amp; Lin, B.M.T. (2024). Makespan minimisation for independent jobs with shared additional operations and parallel identical machines. Computers and Operations Research. 170, 106780.<\/td>\n<\/tr>\n<tr class=\"row-4\">\n\t<td class=\"column-1\">Lin*, B.M.T., Liu, S.W. &amp; Mosheiov, G. (2024). Scheduling with a weight-modifying activity to minimize the total weighted completion time. Omega, 128, 103225.<\/td>\n<\/tr>\n<tr class=\"row-5\">\n\t<td class=\"column-1\">Cheng, T.C.E., Kravchenko, S.A., &amp; Lin*, B.M.T.(2024). On scheduling of step-improving jobs to minimize the total weighted completion time. Journal of the Operational Research Society, 75(4), 720-730.<\/td>\n<\/tr>\n<tr class=\"row-6\">\n\t<td class=\"column-1\">Gupta*, J.N.D., Wu, C.C., Lin, W.C., Zhang, X.G., Bai, D., Lin, B.M.T., &amp; Liao, C.C. (2023). Bicriteria single-machine scheduling with multiple job classes and customer orders. Applied Soft Computing, 147, 110809.<\/td>\n<\/tr>\n<tr class=\"row-7\">\n\t<td class=\"column-1\">Dolgui, A., Kovalyov, M.Y., &amp; Lin*, B.M.T. (2022). Maximizing total early work in a distributed two-machine flow-shop. Naval Research Logistics, 69(8), 1124-1137. <\/td>\n<\/tr>\n<tr class=\"row-8\">\n\t<td class=\"column-1\">Su, Y.C., Lin*, B.M.T. (2022). Minimizing the total weighted completion time in relocation scheduling. Computers &amp; Industrial Engineering, 108662.<\/td>\n<\/tr>\n<tr class=\"row-9\">\n\t<td class=\"column-1\">Chen, X., Miao, Q., Lin*, B.M.T., Sterna, M., Blazewicz, J. (2022). Two-machine flow shop scheduling with a common due date to maximize total early work. European Journal of Operational Research, 300(2), 504-511.<\/td>\n<\/tr>\n<tr class=\"row-10\">\n\t<td class=\"column-1\">Cheng, T.C.E., Kravchenko, S.A., &amp; Lin*, B.M.T. (2021). Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences. Journal of the Operational Research Society, 72(10), 2286-2289.<\/td>\n<\/tr>\n<tr class=\"row-11\">\n\t<td class=\"column-1\">Hao, P.C. &amp; Lin*, B.M.T. (2021). Text mining approach for bottleneck detection and analysis in printed circuit board manufacturing. Computers &amp; Industrial Engineering, 154, 107121.<\/td>\n<\/tr>\n<tr class=\"row-12\">\n\t<td class=\"column-1\">Wu*, C.C., Gupta, J.N.D., Cheng, S.R., Lin, B.M.T., Yip, S.H., Lin, W.C. (2021). Robust min-max regret scheduling for a two-stage assembly shop with scenario-dependent processing times. International Journal of Production Research, 59(17), 5372-538.<\/td>\n<\/tr>\n<tr class=\"row-13\">\n\t<td class=\"column-1\">Agnetis, A., Gawiejnowicz*,\u00a0S., Lin, B.M.T., &amp; G. Mosheiov (2020). Dynamic Scheduling Problems. Journal of Scheduling, 1-2.<\/td>\n<\/tr>\n<tr class=\"row-14\">\n\t<td class=\"column-1\">Shih*, C.H., Li, H.L. Hu, C.C., &amp; Lin, B.M.T. (2020). Forming a TED talks sphere for convenient search. The Electronic Library.<\/td>\n<\/tr>\n<tr class=\"row-15\">\n\t<td class=\"column-1\">Cheng, T.C.E., Kravchenko, S.A., &amp; Lin*, B.M.T. (2020). Scheduling step-deteriorating jobs to minimize the total completion time. Computers &amp; Industrial Engineering, 144, 106329.<\/td>\n<\/tr>\n<tr class=\"row-16\">\n\t<td class=\"column-1\">Kononov, A.V., Kovalyov, M.Y., &amp; Lin*, B.M.T. (2019). Minimizing machine assignment costs over D-approximate solutions of the scheduling problem P||Cmax. Theoretical Computer Science, 793, 70-78.<\/td>\n<\/tr>\n<tr class=\"row-17\">\n\t<td class=\"column-1\">Hong, H.C., &amp; Lin*, B.M.T. (2019). A note on network repair crew scheduling &amp; routing for emergency relief distribution problem. Journal of Industrial and Management Optimization, 15(4), 1729-1731.<\/td>\n<\/tr>\n<tr class=\"row-18\">\n\t<td class=\"column-1\">Hung, H.C., Lin*, B.M.T., Posner, M.E., &amp; Wei, J.M. (2019). Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. Journal of Scheduling, 22(4), 413-431.<\/td>\n<\/tr>\n<tr class=\"row-19\">\n\t<td class=\"column-1\">Cheng, T.C.E. Kravchenko, S.A., &amp; Lin*, B.M.T. (2019). Server scheduling on parallel dedicated machines with fixed job sequences. Naval Research Logistics, 66(4), 321-332.<\/td>\n<\/tr>\n<tr class=\"row-20\">\n\t<td class=\"column-1\">Blazewicz, J., Chen, X., Lee, R.C.T., Lin*, B.M.T., Lin, F.C., Pesch, E., Sterna, M., &amp; Wang, E. (2019). Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work. Engineering Optimization, 51(7), 1279-1280.<\/td>\n<\/tr>\n<tr class=\"row-21\">\n\t<td class=\"column-1\">Hong, H.C., &amp; Lin*, B.M.T. (2018). Parallel dedicated machine scheduling with conflict graphs. Computers &amp; Industrial Engineering, 124, 316-321.<\/td>\n<\/tr>\n<tr class=\"row-22\">\n\t<td class=\"column-1\">Hwang, F.J., &amp; Lin*, B.M.T. (2018). Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines. Computers and Operations Research, 98, 103-112.<\/td>\n<\/tr>\n<tr class=\"row-23\">\n\t<td class=\"column-1\">Cheng, T.C.E., Kravchenko, S.A., &amp; Lin*, B.M.T. (2017). Preemptive parallel-machine scheduling with a common server to minimize makespan. Naval Research Logistics, 64 (5), 355-434.<\/td>\n<\/tr>\n<tr class=\"row-24\">\n\t<td class=\"column-1\">Cheng, T.C.E., &amp; Lin*, B.M.T. (2017). Demonstrating Johnson\u2019s algorithm via resource-constrained scheduling. International Journal of Production Research, 55(11), 5526-5530.<\/td>\n<\/tr>\n<tr class=\"row-25\">\n\t<td class=\"column-1\">Lin*, B.M.T., Hwang, F.J., &amp; Gupta, J.N.D. (2017). Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence. Journal of Scheduling, 20(3), 293-302.<\/td>\n<\/tr>\n<tr class=\"row-26\">\n\t<td class=\"column-1\">Cheng, T.C.E., Lin*, B.M.T., &amp; Huang, H.L. (2017). Talent hold cost minimization in film production. Journal of Industrial and Management Optimization, 17(1), 223-235.<\/td>\n<\/tr>\n<tr class=\"row-27\">\n\t<td class=\"column-1\">\u9b4f\u5fd7\u5e73*\u3001\u6797\u5999\u8070\u3001\u8a31\u9245\u79c9\u3001\u56b4\u79c0\u8339\u3001\u9867\u5b9c\u931a\uff0c\u300c\u7ba1\u7406\u4e8c\u5b78\u9580\u71b1\u9580\u53ca\u524d\u77bb\u5b78\u8853\u7814\u7a76\u8b70\u984c\u8abf\u67e5\u300d \u6210\u679c\u6982\u8ff0\uff0c\u4eba\u6587\u8207\u793e\u6703\u79d1\u5b78\u7c21\u8a0a\uff0c\u537718\uff0c\u671f2\uff0c\u7b2c110-126\u3002<\/td>\n<\/tr>\n<tr class=\"row-28\">\n\t<td class=\"column-1\">Lu, Y.T., Fang, K.T., &amp; Lin*, B.M.T. (2016). Banner advertisement scheduling to maximize space utilization. International Journal of Operations Research, 13(3), 102-120.<\/td>\n<\/tr>\n<tr class=\"row-29\">\n\t<td class=\"column-1\">Yang, C.N., Lin*, B.M.T., Hwang, F.J., &amp; Wang, M.C. (2016). Acquisition planning and scheduling of computing resources. Computers and Operations Research, 76, 167-182.<\/td>\n<\/tr>\n<tr class=\"row-30\">\n\t<td class=\"column-1\">Wang, S.Y., Chuang, Y.T., &amp; Lin*, B.M.T. (2016). Minimizing talent cost and operating cost in film production. Journal of Industrial and Production Engineering, 33(1), 17-31.<\/td>\n<\/tr>\n<tr class=\"row-31\">\n\t<td class=\"column-1\">Hwang, F.J., &amp; Lin*, B.M.T. (2016). Two-stage flexible flow shop scheduling subject to fixed job sequences. Journal of the Operational Research Society, 67(3), 506-515.<\/td>\n<\/tr>\n<tr class=\"row-32\">\n\t<td class=\"column-1\">Tsai, Y.S., &amp; Lin*, B.M.T. (2016). Flow shop non-idle scheduling and resource-constrained scheduling. Annals of Operations Research, 238(1-2), 577-585. <\/td>\n<\/tr>\n<tr class=\"row-33\">\n\t<td class=\"column-1\">Lin*, B.M.T., Hwang, F.J., &amp; Kononov, A.V. (2016). Relocation scheduling subject to fixed processing sequences. Journal of Scheduling, 19(2), 153-163.<\/td>\n<\/tr>\n<tr class=\"row-34\">\n\t<td class=\"column-1\">Lin*, B.M.T. (2015). Resource-constrained scheduling with optional recycling operations. Computers &amp; Industrial Engineering, 90, 39-45.<\/td>\n<\/tr>\n<tr class=\"row-35\">\n\t<td class=\"column-1\">Kononov, A.V., Lin*, B.M.T., &amp; Fang, K.T. (2015). Single-machine scheduling with supporting tasks. Discrete Optimization, 17, 69-79.<\/td>\n<\/tr>\n<tr class=\"row-36\">\n\t<td class=\"column-1\">Lin*, B.M.T. (2014). Two-stage flow shop scheduling with dedicated machines. International Journal of Production Research, 53(4), 1094-1097.<\/td>\n<\/tr>\n<tr class=\"row-37\">\n\t<td class=\"column-1\">Lee*, K., Leung, J.Y.T., Jia, J.H., Li, W., Pinedo, M.L., &amp; Lin, B.M.T. (2014) Fast approximation algorithms for bi-criteria scheduling with machine assignment costs. European Journal of Operational Research, 238(1), 53-64.<\/td>\n<\/tr>\n<tr class=\"row-38\">\n\t<td class=\"column-1\">Hwang, F.J., Kovalyov, M.Y., &amp; Lin*, B.M.T. (2014). Scheduling for fabrication &amp; assembly in a two-machine flowshop with a fixed job sequence. Annals of Operations Research, 217(1), 263-279.<\/td>\n<\/tr>\n<tr class=\"row-39\">\n\t<td class=\"column-1\">Cheng, T.C.E., Lin*, B.M.T., &amp; Tian, Y. (2013). Refurbishing flow shop scheduling to minimize the total completion time. International Journal of Production Research, 51(23-24), 7120-7139. (Invited paper for the 50th Anniversary of IJPR).<\/td>\n<\/tr>\n<tr class=\"row-40\">\n\t<td class=\"column-1\">Ho, T.F., Wu*, Y.L., Shyu, S.J., &amp; Lin, B.M.T. (2015). Discrete particle swarm optimization with scout particles for library materials acquisition. The Scientific World Journal (Operations Research division).<\/td>\n<\/tr>\n<tr class=\"row-41\">\n\t<td class=\"column-1\">Liu, Y.C., Fang, K.T. &amp; Lin*, B.M.T. (2013). A branch-and-bound algorithm for makespan minimization in differentiation flow shops. Engineering Optimization, 45(12), 1397-1408.<\/td>\n<\/tr>\n<tr class=\"row-42\">\n\t<td class=\"column-1\">Huang, T.C., &amp; Lin*, B.M.T. (2013). Batch scheduling in a differentiation flow shop to minimize the makespan. International Journal of Production Research, 51(17), 5073-5082.<\/td>\n<\/tr>\n<tr class=\"row-43\">\n\t<td class=\"column-1\">Lin*, B.M.T., Yin, P.Y., &amp; Liu, Y.S. (2013). Sequence-dependent scheduling with order deliveries. Applied Mathematics and Computation, 222(1), 58-71.<\/td>\n<\/tr>\n<tr class=\"row-44\">\n\t<td class=\"column-1\">Fang, K.T., &amp; Lin*, B.M.T. (2013). Parallel-machine scheduling to minimize tardiness penalty and power cost. Computers &amp; Industrial Engineering, 64(1), 224-234.<\/td>\n<\/tr>\n<tr class=\"row-45\">\n\t<td class=\"column-1\">Lin*, B.M.T., Lin, Y.Y., &amp; Fang, K.T. (2013). Two-machine flow shop scheduling of polyurethane foam production. International Journal of Production Economics, 141(1), 286-294.<\/td>\n<\/tr>\n<tr class=\"row-46\">\n\t<td class=\"column-1\">Lin, F.C., Hung*, J.S., &amp; Lin, B.M.T. (2013). Sequence optimization for media objects with due date constraints in on-the-fly assembled multimedia presentations from digital libraries, Information Systems, 38(1), 82-96.<\/td>\n<\/tr>\n<tr class=\"row-47\">\n\t<td class=\"column-1\">Hwang, F.J., Kovalyov, M.Y., &amp; Lin*, B.M.T. (2012). Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. Discrete Optimization, 9(1), 29-39.<\/td>\n<\/tr>\n<tr class=\"row-48\">\n\t<td class=\"column-1\">Hwang, F.J., &amp; Lin*, B.M.T. (2012). Two-stage assembly-type flowshop batch scheduling subject to a fixed job sequence. Journal of the Operational Research Society, 63(6), 839-845.<\/td>\n<\/tr>\n<tr class=\"row-49\">\n\t<td class=\"column-1\">Cheng, T.C.E., Lin*, B.M.T., &amp; Huang, H.L. (2012). Resource-constrained flowshop scheduling with separate resource recycling operations. Computers and Operations Research, 39(6), 1206-1212.<\/td>\n<\/tr>\n<tr class=\"row-50\">\n\t<td class=\"column-1\">Sevastyanov, S.V., Lin*, B.M.T., &amp; Huang, H.L. (2011). Time complexity analysis in the relocation problem with arbitrary release dates. Theoretical Computer Science, 412(35), 4536-4544.<\/td>\n<\/tr>\n<tr class=\"row-51\">\n\t<td class=\"column-1\">Lin*, B.M.T., &amp; Cheng, T.C.E. (2012). Concurrent open shop scheduling with centralized and decentralized batching policies. Naval Research Logistics, 58(1), 17-27.<\/td>\n<\/tr>\n<tr class=\"row-52\">\n\t<td class=\"column-1\">Hwang, F.J., &amp; Lin*, B.M.T. (2012). Coupled-task scheduling with a fixed job sequence. Computers and Industrial Engineering, 60(4), 690-698.<\/td>\n<\/tr>\n<tr class=\"row-53\">\n\t<td class=\"column-1\">Lin*, B.M.T., &amp; Hwang, F.J. (2011). Total completion time minimization of fixed job sequences in a two-stage differentiation flowshop. Information Processing Letters, 111(5), 208\u2013212.<\/td>\n<\/tr>\n<tr class=\"row-54\">\n\t<td class=\"column-1\">Chen, M.T., Lin*, B.M.T., &amp; Tseng, S.S. (2011). An ant colony optimization for the dynamic routing and wavelength assignment in WDM networks with sparse wavelength conversion. Engineering Applications of Artificial Intelligence, 24(2), 295-305.<\/td>\n<\/tr>\n<tr class=\"row-55\">\n\t<td class=\"column-1\">Gawiejnowicz*, S., &amp; Lin, B.M.T. (2010). Scheduling time-dependent jobs under mixed deterioration. Applied Mathematics and Computation, 216(2), 438-447.<\/td>\n<\/tr>\n<tr class=\"row-56\">\n\t<td class=\"column-1\">Kononov, A.V. &amp; Lin*, B.M.T. (2010). Minimizing the total weighted completion time in the relocation problem. Journal of Scheduling, 13(2), 123-129.<\/td>\n<\/tr>\n<tr class=\"row-57\">\n\t<td class=\"column-1\">Cheng, T.C.E., Lin*, B.M.T., &amp; Tian, Y. (2009). Minimizing weighted machine load in a two-stage flowshop with a common critical machine. Computers and Operations Research, 36(11), 3031-3040.<\/td>\n<\/tr>\n<tr class=\"row-58\">\n\t<td class=\"column-1\">Lin, F.C., Hung*, J.S., &amp; Lin, B.M.T. (2009) A two-machine flowshop problem with processing time-dependent buffer constraints\u2014An application in multimedia presentations. Computers and Operations Research, 36(2), 1158-1175.<\/td>\n<\/tr>\n<tr class=\"row-59\">\n\t<td class=\"column-1\">Cheng, T.C.E. &amp; Lin*, B.M.T. (2009). Johnson\u2019s rule, composite jobs and the relocation problem. European Journal of Operational Research, 192(3), 1008\u20131013.<\/td>\n<\/tr>\n<tr class=\"row-60\">\n\t<td class=\"column-1\">Lin*, B.M.T., Lu, C.Y., Shyu, S..J., &amp; Tsai, C.Y. (2008). Development of new features of ant colony optimization for scheduling problems. International Journal of Production Economics, 112(2), 742-755.<\/td>\n<\/tr>\n<tr class=\"row-61\">\n\t<td class=\"column-1\">Lin*, B.M.T. &amp; Liu, S.T. (2008). Maximizing total reward in the relocation problem subject to generalized due dates. International Journal of Production Economics, 115(1), 55-63.<\/td>\n<\/tr>\n<tr class=\"row-62\">\n\t<td class=\"column-1\">Lin*, B.M.T. &amp; Kononov, A.V. (2007). Customer order scheduling to minimize the number of late orders. European Journal of Operational Research, 183(2), 944-948.<\/td>\n<\/tr>\n<tr class=\"row-63\">\n\t<td class=\"column-1\">Jeng, A.A.K., &amp; Lin*, B.M.T. (2006). A note on parallel-machine scheduling with deteriorating jobs. Journal of the Operational Research Society, 58(6), 824-826.<\/td>\n<\/tr>\n<tr class=\"row-64\">\n\t<td class=\"column-1\">Chen, M.T., Lin*, B.M.T., &amp; Tseng, S.S. (2008). Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities. Journal of Network and Computer Applications, 31(1), 47-65.<\/td>\n<\/tr>\n<tr class=\"row-65\">\n\t<td class=\"column-1\">Lin*, B.M.T. (2007). Complexity results on single-machine scheduling with positional learning effects. Journal of the Operational Research Society, 58(8), 1099-1102.<\/td>\n<\/tr>\n<tr class=\"row-66\">\n\t<td class=\"column-1\">Lin*, B.M.T., Cheng, T.C.E., &amp; Chou, A.S.C. (2007). Scheduling in an assembly-type production chain with batch transfer. Omega,  35(2), 143-151.<\/td>\n<\/tr>\n<tr class=\"row-67\">\n\t<td class=\"column-1\">Kononov, A.V. &amp; Lin*, B.M.T. (2006). On the relocation problems with multiple identical working crews. Discrete Optimization, 3(4), 366-381.<\/td>\n<\/tr>\n<tr class=\"row-68\">\n\t<td class=\"column-1\">Lin*, B.M.T. &amp; Cheng, T.C.E. (2006). Two\u2010machine flowshop scheduling with conditional deteriorating second operations. International Transactions in Operational Research, 13(2), 1-8.<\/td>\n<\/tr>\n<tr class=\"row-69\">\n\t<td class=\"column-1\">Lin*, B.M.T. &amp; Wu, J.M. (2006). Bicriteria scheduling in a two-machine permutation flowshop. International Journal of Production Research, 44(12), 2299-2312.<\/td>\n<\/tr>\n<tr class=\"row-70\">\n\t<td class=\"column-1\">Chen, M.T., Tseng, S.S., &amp; Lin*, B.M.T. (2006). Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities. Computer Communications, 29(9), 1492-1503.<\/td>\n<\/tr>\n<tr class=\"row-71\">\n\t<td class=\"column-1\">Lin*, B.M.T., Lin, F.C., &amp; Lee, R.C.T. (2006). Two-machine flowshop scheduling to minimize total late work. Engineering Optimization, 34(4), 501-509.<\/td>\n<\/tr>\n<tr class=\"row-72\">\n\t<td class=\"column-1\">Lin*, B.M.T. &amp; Huang, H.L. (2006). On the relocation problem with a second working crew for resource recycling. International Journal of Systems Science, 37(1), 27-34.<\/td>\n<\/tr>\n<tr class=\"row-73\">\n\t<td class=\"column-1\">Hwang*, G.J., Lin, T.L., &amp; Lin, B.M.T. (2006). An effective approach for test-sheet composition from large-scale item banks. Computers and Education, 46(2), 122-139.<\/td>\n<\/tr>\n<tr class=\"row-74\">\n\t<td class=\"column-1\">Shyu*, S.J., Lin, B.M.T., &amp; Hsiao, T.S. (2006). Ant colony optimization algorithm for the cell assignment problem in PCS networks. Computers and Operations Research, 33(6), 1713-1740.<\/td>\n<\/tr>\n<tr class=\"row-75\">\n\t<td class=\"column-1\">Lin*, B.M.T. &amp; Wu, J.M. (2005). A simple lower bound for two machine flowshop scheduling to minimize total completion time. Asia Pacific Journal of Operational Research, 22(3), 391-407.<\/td>\n<\/tr>\n<tr class=\"row-76\">\n\t<td class=\"column-1\">Hwang*, G.J., Lin, B.M.T., Tseng, S.H., &amp; Lin, T.L. (2005). On the development of a computer-assisted testing system with genetic test sheet-generating approach. IEEE Transactions on Systems, Man and Cybernetics: Part C, 35(4), 590- 594.<\/td>\n<\/tr>\n<tr class=\"row-77\">\n\t<td class=\"column-1\">Lin*, B.M.T. &amp; Cheng, T.C.E. (2005). Two-machine flowshop batching and scheduling. Annals of Operations Research, 133 (1-4), 149-161.<\/td>\n<\/tr>\n<tr class=\"row-78\">\n\t<td class=\"column-1\">Shyu, S.J., Lin*, B.M.T., &amp; P.Y. Yin, P.Y. (2004). Applications of ant colony optimization for no-wait flowshop scheduling to minimize the total completion time. Computers &amp; Industrial Engineering, 47(2-3), 181-193.<\/td>\n<\/tr>\n<tr class=\"row-79\">\n\t<td class=\"column-1\">Lin*, B.M.T. &amp; Jeng, A.A.K. (2004). Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs. International Journal of Production Economics, 91(2), 121-134<\/td>\n<\/tr>\n<tr class=\"row-80\">\n\t<td class=\"column-1\">Shyu, S.J., Yin, P.Y., &amp; Lin*, B.M.T. (2004). An ant colony optimization algorithm for the minimum weight vertex cover problem. Annals of Operations Research, 131(1-4), 283-304.<\/td>\n<\/tr>\n<tr class=\"row-81\">\n\t<td class=\"column-1\">Jeng, A.A.K. &amp; Lin*, B.M.T. (2004). Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs. Computers and Operations Research, 32(3), 521-536.<\/td>\n<\/tr>\n<tr class=\"row-82\">\n\t<td class=\"column-1\">Lin*, B.M.T. &amp; Wu, J.M. (2004). Effective lower bounds for scheduling problems in two-stage hybrid flowshops. Journal of Management, 22(3), 363-374.<\/td>\n<\/tr>\n<tr class=\"row-83\">\n\t<td class=\"column-1\">Jeng, A.A.K. &amp; Lin*, B.M.T. (2004). Makespan minimization in single-machine scheduling with step-deterioration of processing times. Journal of the Operational Research Society, 55(3), 247-256.<\/td>\n<\/tr>\n<tr class=\"row-84\">\n\t<td class=\"column-1\">Cheng*, T.C.E., Ding, Q., &amp; Lin, B.M.T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152(1), 1-13. <\/td>\n<\/tr>\n<tr class=\"row-85\">\n\t<td class=\"column-1\">Hsu, Y.H. &amp; Lin*, B.M.T. (2003). Algorithms for operations scheduling with linear deterioration. Omega, 31(6), 459-469.<\/td>\n<\/tr>\n<tr class=\"row-86\">\n\t<td class=\"column-1\">Shyu, S.J., Yin, P.Y., Lin*, B.M.T. &amp; Haouari, M. (2003). Ant-Tree: An ant colony optimization approach to the generalized minimum spanning tree problem. Journal of Experimental and Theoretical Artificial Intelligence, 15(1), 103-112. <\/td>\n<\/tr>\n<tr class=\"row-87\">\n\t<td class=\"column-1\">Huang, Y.S. &amp; Lin*, B.M.T. (2002). An empirical study on TQM implementation in Taiwan. The TQM Magazine (currently published as The TQM Journal), 14(3), 172-180.<\/td>\n<\/tr>\n<tr class=\"row-88\">\n\t<td class=\"column-1\">Lin, B.M.T. &amp; Cheng*, T.C.E. (2002). Fabrication and assembly scheduling in a two-machine flowshop. IIE Transactions, 34(11), 1015-1020.<\/td>\n<\/tr>\n<tr class=\"row-89\">\n\t<td class=\"column-1\">Lin*, B.M.T. (2002). Fabrication scheduling in a two-machine flowshop with due date constraints. European Journal of Operational Research, 136(1), 95-105.<\/td>\n<\/tr>\n<tr class=\"row-90\">\n\t<td class=\"column-1\">Lin*, B.M.T., Yu, H.K., &amp; Huang, Y.S. (2001). A heuristic algorithm for the generalized assignment problem. International Journal of Computer Mathematics, 77(4), 535-561. <\/td>\n<\/tr>\n<tr class=\"row-91\">\n\t<td class=\"column-1\">Lin, B.M.T., &amp; Cheng*, T.C.E. (2001). Batch scheduling in a no-wait two-machine flowshop. Computers and Operations Research, 28(7), 613-624.<\/td>\n<\/tr>\n<tr class=\"row-92\">\n\t<td class=\"column-1\">Lin*, B.M.T. (2001). Scheduling in a two-machine flowshop with due date constraints. International Journal of Production Economics, 70(2), 117-123.<\/td>\n<\/tr>\n<tr class=\"row-93\">\n\t<td class=\"column-1\">Shyu, S.J., &amp; Lin*, B.M.T. (2000). An application of PVM framework to film production problem. Computers and Mathematics with Applications, 39(12), 53-62.<\/td>\n<\/tr>\n<tr class=\"row-94\">\n\t<td class=\"column-1\">Cheng*, T.C.E., Lin, B.M.T., &amp; Toker, A. (2000). Flowshop batching and scheduling to minimize the makespan. Naval Research Logistics, 47(2), 128-144.<\/td>\n<\/tr>\n<tr class=\"row-95\">\n\t<td class=\"column-1\">Lin*, B.M.T. (1999). A new branch-and-bound algorithm for the film production problem (in Chinese). Journal of Ming Chuan University, 10(1), 101-110.<\/td>\n<\/tr>\n<tr class=\"row-96\">\n\t<td class=\"column-1\">Lin, B.M.T., &amp; Cheng*, T.C.E., Relocation problems to minimize the maximum tardiness and the number of tardy jobs. European Journal of Operational Research, 116(1), 183-193.<\/td>\n<\/tr>\n<tr class=\"row-97\">\n\t<td class=\"column-1\">Cheng*, T.C.E., Chen, Z.L., Li, C.L., &amp; Lin, B.M.T. (1998). Single machine scheduling to minimize the sum of compression and late costs. Naval Research Logistics, 45(1), 67-82. <\/td>\n<\/tr>\n<tr class=\"row-98\">\n\t<td class=\"column-1\">Lin*, B.M.T. (1999). On the strong NP-hardness of two-stage flowshop scheduling problem with a common second-stage machine. Computers and Operations Research, 26(7), 695-698.<\/td>\n<\/tr>\n<tr class=\"row-99\">\n\t<td class=\"column-1\">Lin*, B.M.T. &amp; Shyu, S.J. (1997). A random search strategy for the film production problem (in Chinese). MIS Review, 6, 17-26.<\/td>\n<\/tr>\n<tr class=\"row-100\">\n\t<td class=\"column-1\">Oguz, C., Lin, B.M.T., &amp; Cheng*, T.C.E. (1997). Two-stage flowshop scheduling problem with a common second-stage machine. Computers and Operations Research, 24(12), 1169-1174.<\/td>\n<\/tr>\n<tr class=\"row-101\">\n\t<td class=\"column-1\">Tseng, S.S., Lin*, B.M.T., &amp; Liu, S.H. (1997). Constructing N_\\gamma Latin squares for \\gamma \\neq 2^\\alpha. Journal of Information Science and Engineering, 13(4), 605-613.<\/td>\n<\/tr>\n<tr class=\"row-102\">\n\t<td class=\"column-1\">Cheng*, T.C.E., Kovalyov, M.Y., &amp; Lin, B.M.T. (1997). Single machine scheduling to minimize the batch delivery and job earliness penalty. SIAM Journal on Optimization, 7(2), 547-559. <\/td>\n<\/tr>\n<tr class=\"row-103\">\n\t<td class=\"column-1\">Cheng*, T.C.E., Chen, Z.L., Kovalyov, M.Y., &amp; Lin, B.M.T. (1996). Parallel-machine batching and scheduling to minimize total completion time. IIE Transactions, 28(11), 953-956.<\/td>\n<\/tr>\n<tr class=\"row-104\">\n\t<td class=\"column-1\">Lin*, B.M.T. (1994). On finding the most vital job in relocation problems. Journal of the Operations Research Society of Japan, 37(3), 182-187.<\/td>\n<\/tr>\n<tr class=\"row-105\">\n\t<td class=\"column-1\">Cheng*, T.C.E., Diamond, J.D., &amp; Lin, B.M.T. (1993). Optimal scheduling in film production to minimize talent hold cost. Journal of Optimization Theory and Applications, 79(3), 197-206. <\/td>\n<\/tr>\n<tr class=\"row-106\">\n\t<td class=\"column-1\">Lee*, C.Y., Cheng, T.C.E., &amp; Lin, B.M.T. (1993). Minimizing the makespan in the three-machine assembly type flow shop problem. Management Science, 39(5), 616-625. <\/td>\n<\/tr>\n<tr class=\"row-107\">\n\t<td class=\"column-1\">Lin, B.M.T., &amp; Tseng*, S.S. (1993). Generating the best K sequences in the relocation problems. European Journal of Operational Research, 69(1), 131-137. <\/td>\n<\/tr>\n<tr class=\"row-108\">\n\t<td class=\"column-1\">Lin, B.M.T., &amp; Tseng*, S.S. (1992). On the relocation problems of maximizing new capacities under a common due-date. International Journal of Systems Science, 23(9), 1433-1448.<\/td>\n<\/tr>\n<tr class=\"row-109\">\n\t<td class=\"column-1\">Lin, B.M.T., &amp; Tseng*, S.S. (1991). Some results of relocation problems with processing times and deadlines. International Journal of Computer Mathematics, 41(1), 1-15. <\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<!-- #tablepress-33 from cache -->\n\n\n<table id=\"tablepress-35\" class=\"tablepress tablepress-id-35\">\n<thead>\n<tr class=\"row-1\">\n\t<th class=\"column-1\">Others<\/th>\n<\/tr>\n<\/thead>\n<tbody class=\"row-striping row-hover\">\n<tr class=\"row-2\">\n\t<td class=\"column-1\">HL Huang and BMT Lin, Concurrent openshop problem to minimize the weighted number of late jobs, in Multiprocessor Scheduling: Theory and Applications, Ed., Eugene Levner, I-TECH Education and Publishing, 2007, Vienna, Austria.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<!-- #tablepress-35 from cache --><\/div><\/div>\n\n\n\n<div class=\"wp-block-getwid-tabs__nav-link\"><span class=\"wp-block-getwid-tabs__title-wrapper\"><a href=\"#\"><span class=\"wp-block-getwid-tabs__title\">Laboratory<\/span><\/a><\/span><\/div><div class=\"wp-block-getwid-tabs__tab-content-wrapper\"><div class=\"wp-block-getwid-tabs__tab-content\">\n<details class=\"wp-block-details has-black-color has-text-color has-link-color has-medium-font-size wp-elements-0ad0ade610024c9c522e2137b672aefa is-layout-flow wp-container-core-details-is-layout-8a368f38 wp-block-details-is-layout-flow\" style=\"border-style:none;border-width:0px\"><summary>Laboratory introduction<\/summary>\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-455576812366f2f8d8a2a30e6dfc6422\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60)\">Research:<\/h6>\n\n\n\n<p class=\"has-palette-color-3-color has-text-color has-link-color wp-elements-8f38b187ddb0829c65aeba5c195b32aa\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60);font-size:clamp(14px, 0.875rem + ((1vw - 3.2px) * 0.234), 17px);\">We focus on the research of scheduling and optimization theory. We use integer programming, dynamic programming and other methods to find the optimal solution. However, the problem we actually encountered is \u201chard\u201d and complex. It is difficult to use the above method in a short time to get the solution. We take another method which called meta-heuristic to get the approximate solution, such as ACO (Ant Colony Optimization), PSO (Particle Swarm Optimization)\u2026.<\/p>\n\n\n\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-37443b758ca32ca46d58f4bc63410573\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60)\">Meeting:<\/h6>\n\n\n\n<p class=\"has-palette-color-3-color has-text-color has-link-color wp-elements-9b08a7f445d59b597605c9d8e6fb9421\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60);font-size:clamp(14px, 0.875rem + ((1vw - 3.2px) * 0.234), 17px);\">The meeting of each semester will be adjusted flexibly and the form of the meeting is open for discussion. Sometimes we need to report papers.<\/p>\n\n\n\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-5a2529fa4b240562091f18b687899c21\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60);padding-right:0;padding-left:0\">Activity:<\/h6>\n\n\n\n<p class=\"has-palette-color-3-color has-text-color has-link-color wp-elements-49aaa59ff637e2fdb82b0a0b326051bf\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60);font-size:clamp(14px, 0.875rem + ((1vw - 3.2px) * 0.234), 17px);\">The laboratory will have meals with teachers from time to time, and occasionally participate in activities held by other laboratories. In addition to fun activities, there are also opportunities for academic exchanges and interactions with foreign scholars invited by teachers.<\/p>\n<\/details>\n\n\n\n<details class=\"wp-block-details has-black-color has-text-color has-link-color has-medium-font-size wp-elements-db3aff429205c89ba888f90ddb71cccd is-layout-flow wp-container-core-details-is-layout-8a368f38 wp-block-details-is-layout-flow\"><summary>Laboratory Direction<\/summary>\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-1bf16f53c2d4bd45006adc034e1652c6\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60)\">Scheduling Theory and Applications <\/h6>\n\n\n\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-f9ce76ce49d79c56b02bc4761b39d8ff\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60)\">Optimization Theory and Applications<\/h6>\n<\/details>\n\n\n\n<details class=\"wp-block-details has-black-color has-text-color has-link-color has-medium-font-size wp-elements-eefdf70091a2e9e083a8f8e4998b540f is-layout-flow wp-container-core-details-is-layout-8a368f38 wp-block-details-is-layout-flow\"><summary>Research tool<\/summary>\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-c41fa97de223f4322a8977aa24b47f80\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60)\">Solve the problem tool: Gurobi<\/h6>\n\n\n\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-ae53a48aa6cec30ec50e28fef03b7e27\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60)\">Editing tool: LaTex<\/h6>\n\n\n\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-5a22d1ba1ace096fa9d9bb5cacf56655\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60)\">Programming language: No limit<\/h6>\n<\/details>\n\n\n\n<details class=\"wp-block-details has-black-color has-text-color has-link-color has-medium-font-size wp-elements-7750bee28e5e070a0f1628baa87234af is-layout-flow wp-container-core-details-is-layout-8a368f38 wp-block-details-is-layout-flow\"><summary>Basic Requirements<\/summary>\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-fe66e1fa0e2ffc15a58fe8f36b35770d\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60)\">Programming Design<\/h6>\n\n\n\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-6f82b16b26991c08bd55a1fc2b8f4afc\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60)\">Data Structure<\/h6>\n\n\n\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-53b0f65149b2c3a7cd1f0c9473feefb1\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60)\">Operations Research<\/h6>\n\n\n\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-d1c21c9040014c7cc93385f15de2b926\" style=\"margin-right:var(--wp--preset--spacing--60);margin-left:var(--wp--preset--spacing--60)\">Algorithms<\/h6>\n<\/details>\n\n\n\n<details class=\"wp-block-details has-black-color has-text-color has-link-color has-medium-font-size wp-elements-8ac4382ab18668f78e60e588b3c188bc is-layout-flow wp-container-core-details-is-layout-8a368f38 wp-block-details-is-layout-flow\"><summary>Contact<\/summary>\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-2d04ab81712584426dcb9782a2e3a83a\" style=\"margin-top:0;margin-right:var(--wp--preset--spacing--60);margin-bottom:0;margin-left:var(--wp--preset--spacing--60)\">\u8521\u7dad\u6021 \/ vei.mg13@nycu.edu.tw<\/h6>\n\n\n\n<h6 class=\"wp-block-heading has-palette-color-3-color has-text-color has-link-color wp-elements-4e6933704b71218040f7f26980c24765\" style=\"margin-top:0;margin-right:var(--wp--preset--spacing--60);margin-bottom:0;margin-left:var(--wp--preset--spacing--60)\">\u5468\u5609\u57ce \/ jczho.mg14@nycu.edu.tw<\/h6>\n<\/details>\n\n\n\n<details class=\"wp-block-details has-black-color has-text-color has-link-color has-medium-font-size wp-elements-641751914118d211d922ae094ffe4fcb is-layout-flow wp-container-core-details-is-layout-8a368f38 wp-block-details-is-layout-flow\"><summary>Laboratory Highlights<\/summary>\n<figure class=\"wp-block-gallery has-nested-images columns-default is-cropped wp-block-gallery-2 is-layout-flex wp-block-gallery-is-layout-flex\">\n<figure class=\"wp-block-image size-large\"><img decoding=\"async\" width=\"1024\" height=\"576\" data-id=\"2047\" src=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e95105b417609923-1024x576.jpg\" alt=\"\" class=\"wp-image-2047\" srcset=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e95105b417609923-1024x576.jpg 1024w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e95105b417609923-300x169.jpg 300w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e95105b417609923-768x432.jpg 768w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e95105b417609923-200x113.jpg 200w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e95105b417609923.jpg 1184w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/figure>\n\n\n\n<figure class=\"wp-block-image size-large is-style-default\"><img decoding=\"async\" width=\"1024\" height=\"576\" data-id=\"2046\" src=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e9506e1726959284-1024x576.jpg\" alt=\"\" class=\"wp-image-2046\" srcset=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e9506e1726959284-1024x576.jpg 1024w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e9506e1726959284-300x169.jpg 300w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e9506e1726959284-768x432.jpg 768w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e9506e1726959284-200x113.jpg 200w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58feb2e9506e1726959284.jpg 1184w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/figure>\n\n\n\n<figure class=\"wp-block-image size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"700\" height=\"717\" data-id=\"2051\" src=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee1370ab850928898424.jpg\" alt=\"\" class=\"wp-image-2051\" srcset=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee1370ab850928898424.jpg 700w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee1370ab850928898424-293x300.jpg 293w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee1370ab850928898424-200x205.jpg 200w\" sizes=\"(max-width: 700px) 100vw, 700px\" \/><\/figure>\n\n\n\n<figure class=\"wp-block-image size-full has-custom-border\"><img loading=\"lazy\" decoding=\"async\" width=\"960\" height=\"720\" data-id=\"2043\" src=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee1370ab850475366950.jpg\" alt=\"\" class=\"wp-image-2043\" style=\"border-style:none;border-width:0px\" srcset=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee1370ab850475366950.jpg 960w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee1370ab850475366950-300x225.jpg 300w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee1370ab850475366950-768x576.jpg 768w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee1370ab850475366950-200x150.jpg 200w\" sizes=\"(max-width: 960px) 100vw, 960px\" \/><\/figure>\n\n\n\n<figure class=\"wp-block-image size-large\"><img loading=\"lazy\" decoding=\"async\" width=\"1024\" height=\"768\" data-id=\"2045\" src=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee13710bacd528263339-1024x768.jpg\" alt=\"\" class=\"wp-image-2045\" srcset=\"https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee13710bacd528263339-1024x768.jpg 1024w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee13710bacd528263339-300x225.jpg 300w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee13710bacd528263339-768x576.jpg 768w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee13710bacd528263339-1536x1152.jpg 1536w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee13710bacd528263339-200x150.jpg 200w, https:\/\/iim.nycu.edu.tw\/wp-content\/uploads\/2024\/01\/58ee13710bacd528263339.jpg 2048w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/figure>\n<\/figure>\n<\/details>\n<\/div><\/div>\n<\/div>\n<\/div>","protected":false},"excerpt":{"rendered":"<p>\u6797\u5999\u8070-\u6559\u6388 \u5e2b\u8cc7\u8207\u5be6\u9a57\u5ba4 \/ \u5c08\u4efb\u6559\u5e2b \u6797\u5999\u8070 \u7814\u7a76\u5ba4 \u6821\u5167\u5206\u6a5f \u96fb\u5b50\u90f5\u4ef6 \u5be6\u9a57\u5ba4 \u500b\u4eba\u7db2\u7ad9 \u6559\u6388 \u7ba1\u7406\u4e8c\u9928 [&hellip;]<\/p>\n","protected":false},"author":6,"featured_media":0,"parent":1568,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_uag_custom_page_level_css":"","footnotes":""},"class_list":["post-992","page","type-page","status-publish","hentry"],"blocksy_meta":[],"aioseo_notices":[],"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":false,"trp-custom-language-flag":false},"uagb_author_info":{"display_name":"\u912d \u701a","author_link":"https:\/\/iim.nycu.edu.tw\/en\/author\/hanworld"},"uagb_comment_info":0,"uagb_excerpt":"\u6797\u5999\u8070-\u6559\u6388 \u5e2b\u8cc7\u8207\u5be6\u9a57\u5ba4 \/ \u5c08\u4efb\u6559\u5e2b \u6797\u5999\u8070 \u7814\u7a76\u5ba4 \u6821\u5167\u5206\u6a5f \u96fb\u5b50\u90f5\u4ef6 \u5be6\u9a57\u5ba4 \u500b\u4eba\u7db2\u7ad9 \u6559\u6388 \u7ba1\u7406\u4e8c\u9928&hellip;","_links":{"self":[{"href":"https:\/\/iim.nycu.edu.tw\/en\/wp-json\/wp\/v2\/pages\/992","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/iim.nycu.edu.tw\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/iim.nycu.edu.tw\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/iim.nycu.edu.tw\/en\/wp-json\/wp\/v2\/users\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/iim.nycu.edu.tw\/en\/wp-json\/wp\/v2\/comments?post=992"}],"version-history":[{"count":74,"href":"https:\/\/iim.nycu.edu.tw\/en\/wp-json\/wp\/v2\/pages\/992\/revisions"}],"predecessor-version":[{"id":3922,"href":"https:\/\/iim.nycu.edu.tw\/en\/wp-json\/wp\/v2\/pages\/992\/revisions\/3922"}],"up":[{"embeddable":true,"href":"https:\/\/iim.nycu.edu.tw\/en\/wp-json\/wp\/v2\/pages\/1568"}],"wp:attachment":[{"href":"https:\/\/iim.nycu.edu.tw\/en\/wp-json\/wp\/v2\/media?parent=992"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}