林妙聰資訊管理研究所115-05-18115-07-30<![CDATA[<div class="ed_model09 clearfix"> <div class="ed_title03"> </div> <div class="ed_pic_left"><img alt="林妙聰照片" src="/userfiles/iimch/images/20260518123829411.png"></div> <div class="ed_txt"><br> 教授<br> <strong>林妙聰</strong><br> <br> 研究室　　　管理二館MB310<br> 校內分機　　57410, 31472<br> 電子信箱　　<a href="mailto:bmtlin@nycu.edu.tw" title="bmtlin@nycu.edu.tw" id="1-2">bmtlin@nycu.edu.tw</a><br> 實驗室　　　最佳化理論與應用實驗室</div> <hr class="ed_border01"> <div class="ed_title03"> </div> </div><div class="ed_model06 clearfix"> <div class="ed_txt"> </div> <div class="table01"> <table class="ed_table caption-top" summary="預設表格形式"> <tbody> <tr> <th>實驗室</th> <th>研究領域</th> <th>開授課程</th> </tr> <tr> <td class="ed_pc_center" data-th="編號">名稱：最佳化理論與應用實驗室</td> <td data-th="項目" style="text-align: center;">排程理論</td> <td data-th="相關連結" style="text-align: center;">排程理論與應用</td> </tr> <tr> <td class="ed_pc_center" data-th="編號">地點：管理二館MB313B</td> <td data-th="項目" style="text-align: center;">作業管理</td> <td data-th="相關連結" style="text-align: center;">高等演算法</td> </tr> <tr> <td class="ed_pc_center" data-th="編號">分機：57419</td> <td data-th="項目" style="text-align: center;">離散最佳化</td> <td data-th="相關連結" style="text-align: center;">演算法</td> </tr> <tr> <td class="ed_pc_center" data-th="編號"> </td> <td data-th="項目" style="text-align: center;"> </td> <td data-th="相關連結" style="text-align: center;">資料結構</td> </tr> </tbody> </table> </div> </div> <div class="ed_model04 clearfix"> <div class="ed_flex_box"> <div class="box"> <div class="ed_pic"> </div> </div> </div> </div><div class="ed_model18 clearfix"><button aria-controls="ed_model18_collapse18348131" aria-expanded="false" class="btn w-100 text-start d-flex justify-content-between" data-bs-target="#ed_model18_collapse18348131" data-bs-toggle="collapse" type="button"> <div class="ed-model18-title-text">主要經歷</div> <div class="arrow"> <div> </div> </div> </button> <div class="collapse show" id="ed_model18_collapse18348131"> <div class="content"> <ul> <li><strong>學歷</strong> <ul> <li>國立交通大學 資訊工程學系博士</li> <li>國立交通大學 資訊科學系</li> </ul> </li> <li><strong>經歷</strong> <ul> <li>國立交通大學資訊管理研究所 所長</li> <li>國立交通大學資訊管理與財務金融學系 教授</li> <li>國立暨南大學資訊管理學系 教授、系主任</li> <li>銘傳大學資訊科學系 教授、系主任</li> <li>銘傳大學資訊管理學系 副教授</li> </ul> </li> <li><strong>訪問學者</strong> <ul> <li>Department of Industrial & Operations Engineering, University of Michigan</li> <li>Department of Computer Science, NJIT</li> <li>Sobolev of Mathematics, Russian Academy of Sciences</li> <li>IBM T.J. Watson Research Center, N.Y.</li> </ul> </li> <li><strong>訪問教授</strong> <ul> <li>Faculty of Physical and Mathematical Sciences, University of Technology Sydney</li> <li>Warwick Business School, Warwick University</li> <li>Senior Research Fellow</li> <li>Department of Management, The Hong Kong Polytechnic University</li> </ul> </li> <li><strong>期刊編輯服務</strong> <ul> <li>Area editor, NTU Management Review 台大管理論叢 (12/2022~)</li> <li>Associate editor, Asia-Pacific Journal of Operational Research (09/2008~)</li> </ul> </li> <li><strong>已卸任</strong> <ul> <li>Area editor, Sun Yat-Sen Management Review中山管理評論 (01/2017~07/2019)</li> <li>Editorial board member, International Journal of Production Economics (04/2008~02/2021)</li> </ul> </li> </ul> </div> </div> </div><div class="ed_model18 clearfix"><button aria-controls="ed_model18_collapse1824491" aria-expanded="false" class="btn w-100 text-start d-flex justify-content-between" data-bs-target="#ed_model18_collapse1824491" data-bs-toggle="collapse" type="button"> <div class="ed-model18-title-text">期刊論文</div> <div class="arrow"> <div> </div> </div> </button> <div class="collapse show" id="ed_model18_collapse1824491"> <div class="content"> <ol> <li>Huang, C.T., Hsieh, T.J. & Lin*, B.M.T. (2024). Data-driven scheduling for the photolithography process in semiconductor manufacturing. Accepted by Journal of Industrial and Management Optimization.</li> <li>Zinder, Y., Berlinska*, J. & Lin, B.M.T. (2024). Makespan minimisation for independent jobs with shared additional operations and parallel identical machines. Computers and Operations Research. 170, 106780.</li> <li>Lin*, B.M.T., Liu, S.W. & Mosheiov, G. (2024). Scheduling with a weight-modifying activity to minimize the total weighted completion time. Omega, 128, 103225.</li> <li>Cheng, T.C.E., Kravchenko, S.A., & 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.</li> <li>Gupta*, J.N.D., Wu, C.C., Lin, W.C., Zhang, X.G., Bai, D., Lin, B.M.T., & Liao, C.C. (2023). Bicriteria single-machine scheduling with multiple job classes and customer orders. Applied Soft Computing, 147, 110809.</li> <li>Dolgui, A., Kovalyov, M.Y., & Lin*, B.M.T. (2022). Maximizing total early work in a distributed two-machine flow-shop. Naval Research Logistics, 69(8), 1124-1137.</li> <li>Su, Y.C., Lin*, B.M.T. (2022). Minimizing the total weighted completion time in relocation scheduling. Computers & Industrial Engineering, 108662.</li> <li>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.</li> <li>Cheng, T.C.E., Kravchenko, S.A., & 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.</li> <li>Hao, P.C. & Lin*, B.M.T. (2021). Text mining approach for bottleneck detection and analysis in printed circuit board manufacturing. Computers & Industrial Engineering, 154, 107121.</li> <li>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.</li> <li>Agnetis, A., Gawiejnowicz*, S., Lin, B.M.T., & G. Mosheiov (2020). Dynamic Scheduling Problems. Journal of Scheduling, 1-2.</li> <li>Shih*, C.H., Li, H.L. Hu, C.C., & Lin, B.M.T. (2020). Forming a TED talks sphere for convenient search. The Electronic Library.</li> <li>Cheng, T.C.E., Kravchenko, S.A., & Lin*, B.M.T. (2020). Scheduling step-deteriorating jobs to minimize the total completion time. Computers & Industrial Engineering, 144, 106329.</li> <li>Kononov, A.V., Kovalyov, M.Y., & 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.</li> <li>Hong, H.C., & Lin*, B.M.T. (2019). A note on network repair crew scheduling & routing for emergency relief distribution problem. Journal of Industrial and Management Optimization, 15(4), 1729-1731.</li> <li>Hung, H.C., Lin*, B.M.T., Posner, M.E., & Wei, J.M. (2019). Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. Journal of Scheduling, 22(4), 413-431.</li> <li>Cheng, T.C.E. Kravchenko, S.A., & Lin*, B.M.T. (2019). Server scheduling on parallel dedicated machines with fixed job sequences. Naval Research Logistics, 66(4), 321-332.</li> <li>Blazewicz, J., Chen, X., Lee, R.C.T., Lin*, B.M.T., Lin, F.C., Pesch, E., Sterna, M., & Wang, E. (2019). Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work. Engineering Optimization, 51(7), 1279-1280.</li> <li>Hong, H.C., & Lin*, B.M.T. (2018). Parallel dedicated machine scheduling with conflict graphs. Computers & Industrial Engineering, 124, 316-321.</li> <li>Hwang, F.J., & 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.</li> <li>Cheng, T.C.E., Kravchenko, S.A., & Lin*, B.M.T. (2017). Preemptive parallel-machine scheduling with a common server to minimize makespan. Naval Research Logistics, 64 (5), 355-434.</li> <li>Cheng, T.C.E., & Lin*, B.M.T. (2017). Demonstrating Johnson’s algorithm via resource-constrained scheduling. International Journal of Production Research, 55(11), 5526-5530.</li> <li>Lin*, B.M.T., Hwang, F.J., & 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.</li> <li>Cheng, T.C.E., Lin*, B.M.T., & Huang, H.L. (2017). Talent hold cost minimization in film production. Journal of Industrial and Management Optimization, 17(1), 223-235.</li> <li>魏志平*、林妙聰、許鉅秉、嚴秀茹、顧宜錚，「管理二學門熱門及前瞻學術研究議題調查」 成果概述，人文與社會科學簡訊，卷18，期2，第110-126。</li> <li>Lu, Y.T., Fang, K.T., & Lin*, B.M.T. (2016). Banner advertisement scheduling to maximize space utilization. International Journal of Operations Research, 13(3), 102-120.</li> <li>Yang, C.N., Lin*, B.M.T., Hwang, F.J., & Wang, M.C. (2016). Acquisition planning and scheduling of computing resources. Computers and Operations Research, 76, 167-182.</li> <li>Wang, S.Y., Chuang, Y.T., & Lin*, B.M.T. (2016). Minimizing talent cost and operating cost in film production. Journal of Industrial and Production Engineering, 33(1), 17-31.</li> <li>Hwang, F.J., & 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.</li> <li>Tsai, Y.S., & Lin*, B.M.T. (2016). Flow shop non-idle scheduling and resource-constrained scheduling. Annals of Operations Research, 238(1-2), 577-585.</li> <li>Lin*, B.M.T., Hwang, F.J., & Kononov, A.V. (2016). Relocation scheduling subject to fixed processing sequences. Journal of Scheduling, 19(2), 153-163.</li> <li>Lin*, B.M.T. (2015). Resource-constrained scheduling with optional recycling operations. Computers & Industrial Engineering, 90, 39-45.</li> <li>Kononov, A.V., Lin*, B.M.T., & Fang, K.T. (2015). Single-machine scheduling with supporting tasks. Discrete Optimization, 17, 69-79.</li> <li>Lin*, B.M.T. (2014). Two-stage flow shop scheduling with dedicated machines. International Journal of Production Research, 53(4), 1094-1097.</li> <li>Lee*, K., Leung, J.Y.T., Jia, J.H., Li, W., Pinedo, M.L., & 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.</li> <li>Hwang, F.J., Kovalyov, M.Y., & Lin*, B.M.T. (2014). Scheduling for fabrication & assembly in a two-machine flowshop with a fixed job sequence. Annals of Operations Research, 217(1), 263-279.</li> <li>Cheng, T.C.E., Lin*, B.M.T., & 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).</li> <li>Ho, T.F., Wu*, Y.L., Shyu, S.J., & Lin, B.M.T. (2015). Discrete particle swarm optimization with scout particles for library materials acquisition. The Scientific World Journal (Operations Research division).</li> <li>Liu, Y.C., Fang, K.T. & Lin*, B.M.T. (2013). A branch-and-bound algorithm for makespan minimization in differentiation flow shops. Engineering Optimization, 45(12), 1397-1408.</li> <li>Huang, T.C., & 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.</li> <li>Lin*, B.M.T., Yin, P.Y., & Liu, Y.S. (2013). Sequence-dependent scheduling with order deliveries. Applied Mathematics and Computation, 222(1), 58-71.</li> <li>Fang, K.T., & Lin*, B.M.T. (2013). Parallel-machine scheduling to minimize tardiness penalty and power cost. Computers & Industrial Engineering, 64(1), 224-234.</li> <li>Lin*, B.M.T., Lin, Y.Y., & Fang, K.T. (2013). Two-machine flow shop scheduling of polyurethane foam production. International Journal of Production Economics, 141(1), 286-294.</li> <li>Lin, F.C., Hung*, J.S., & 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.</li> <li>Hwang, F.J., Kovalyov, M.Y., & 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.</li> <li>Hwang, F.J., & 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.</li> <li>Cheng, T.C.E., Lin*, B.M.T., & Huang, H.L. (2012). Resource-constrained flowshop scheduling with separate resource recycling operations. Computers and Operations Research, 39(6), 1206-1212.</li> <li>Sevastyanov, S.V., Lin*, B.M.T., & Huang, H.L. (2011). Time complexity analysis in the relocation problem with arbitrary release dates. Theoretical Computer Science, 412(35), 4536-4544.</li> <li>Lin*, B.M.T., & Cheng, T.C.E. (2012). Concurrent open shop scheduling with centralized and decentralized batching policies. Naval Research Logistics, 58(1), 17-27.</li> <li>Hwang, F.J., & Lin*, B.M.T. (2012). Coupled-task scheduling with a fixed job sequence. Computers and Industrial Engineering, 60(4), 690-698.</li> <li>Lin*, B.M.T., & Hwang, F.J. (2011). Total completion time minimization of fixed job sequences in a two-stage differentiation flowshop. Information Processing Letters, 111(5), 208–212.</li> <li>Chen, M.T., Lin*, B.M.T., & 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.</li> <li>Gawiejnowicz*, S., & Lin, B.M.T. (2010). Scheduling time-dependent jobs under mixed deterioration. Applied Mathematics and Computation, 216(2), 438-447.</li> <li>Kononov, A.V. & Lin*, B.M.T. (2010). Minimizing the total weighted completion time in the relocation problem. Journal of Scheduling, 13(2), 123-129.</li> <li>Cheng, T.C.E., Lin*, B.M.T., & 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.</li> <li>Lin, F.C., Hung*, J.S., & Lin, B.M.T. (2009) A two-machine flowshop problem with processing time-dependent buffer constraints—An application in multimedia presentations. Computers and Operations Research, 36(2), 1158-1175.</li> <li>Cheng, T.C.E. & Lin*, B.M.T. (2009). Johnson’s rule, composite jobs and the relocation problem. European Journal of Operational Research, 192(3), 1008–1013.</li> <li>Lin*, B.M.T., Lu, C.Y., Shyu, S..J., & Tsai, C.Y. (2008). Development of new features of ant colony optimization for scheduling problems. International Journal of Production Economics, 112(2), 742-755.</li> <li>Lin*, B.M.T. & 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.</li> <li>Lin*, B.M.T. & Kononov, A.V. (2007). Customer order scheduling to minimize the number of late orders. European Journal of Operational Research, 183(2), 944-948.</li> <li>Jeng, A.A.K., & Lin*, B.M.T. (2006). A note on parallel-machine scheduling with deteriorating jobs. Journal of the Operational Research Society, 58(6), 824-826.</li> <li>Chen, M.T., Lin*, B.M.T., & 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.</li> <li>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.</li> <li>Lin*, B.M.T., Cheng, T.C.E., & Chou, A.S.C. (2007). Scheduling in an assembly-type production chain with batch transfer. Omega, 35(2), 143-151.</li> <li>Kononov, A.V. & Lin*, B.M.T. (2006). On the relocation problems with multiple identical working crews. Discrete Optimization, 3(4), 366-381.</li> <li>Lin*, B.M.T. & Cheng, T.C.E. (2006). Two‐machine flowshop scheduling with conditional deteriorating second operations. International Transactions in Operational Research, 13(2), 1-8.</li> <li>Lin*, B.M.T. & Wu, J.M. (2006). Bicriteria scheduling in a two-machine permutation flowshop. International Journal of Production Research, 44(12), 2299-2312.</li> <li>Chen, M.T., Tseng, S.S., & 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.</li> <li>Lin*, B.M.T., Lin, F.C., & Lee, R.C.T. (2006). Two-machine flowshop scheduling to minimize total late work. Engineering Optimization, 34(4), 501-509.</li> <li>Lin*, B.M.T. & 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.</li> <li>Hwang*, G.J., Lin, T.L., & Lin, B.M.T. (2006). An effective approach for test-sheet composition from large-scale item banks. Computers and Education, 46(2), 122-139.</li> <li>Shyu*, S.J., Lin, B.M.T., & Hsiao, T.S. (2006). Ant colony optimization algorithm for the cell assignment problem in PCS networks. Computers and Operations Research, 33(6), 1713-1740.</li> <li>Lin*, B.M.T. & 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.</li> <li>Hwang*, G.J., Lin, B.M.T., Tseng, S.H., & 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.</li> <li>Lin*, B.M.T. & Cheng, T.C.E. (2005). Two-machine flowshop batching and scheduling. Annals of Operations Research, 133 (1-4), 149-161.</li> <li>Shyu, S.J., Lin*, B.M.T., & P.Y. Yin, P.Y. (2004). Applications of ant colony optimization for no-wait flowshop scheduling to minimize the total completion time. Computers & Industrial Engineering, 47(2-3), 181-193.</li> <li>Lin*, B.M.T. & 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</li> <li>Shyu, S.J., Yin, P.Y., & 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.</li> <li>Jeng, A.A.K. & 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.</li> <li>Lin*, B.M.T. & Wu, J.M. (2004). Effective lower bounds for scheduling problems in two-stage hybrid flowshops. Journal of Management, 22(3), 363-374.</li> <li>Jeng, A.A.K. & 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.</li> <li>Cheng*, T.C.E., Ding, Q., & Lin, B.M.T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152(1), 1-13.</li> <li>Hsu, Y.H. & Lin*, B.M.T. (2003). Algorithms for operations scheduling with linear deterioration. Omega, 31(6), 459-469.</li> <li>Shyu, S.J., Yin, P.Y., Lin*, B.M.T. & 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.</li> <li>Huang, Y.S. & 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.</li> <li>Lin, B.M.T. & Cheng*, T.C.E. (2002). Fabrication and assembly scheduling in a two-machine flowshop. IIE Transactions, 34(11), 1015-1020.</li> <li>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.</li> <li>Lin*, B.M.T., Yu, H.K., & Huang, Y.S. (2001). A heuristic algorithm for the generalized assignment problem. International Journal of Computer Mathematics, 77(4), 535-561.</li> <li>Lin, B.M.T., & Cheng*, T.C.E. (2001). Batch scheduling in a no-wait two-machine flowshop. Computers and Operations Research, 28(7), 613-624.</li> <li>Lin*, B.M.T. (2001). Scheduling in a two-machine flowshop with due date constraints. International Journal of Production Economics, 70(2), 117-123.</li> <li>Shyu, S.J., & Lin*, B.M.T. (2000). An application of PVM framework to film production problem. Computers and Mathematics with Applications, 39(12), 53-62.</li> <li>Cheng*, T.C.E., Lin, B.M.T., & Toker, A. (2000). Flowshop batching and scheduling to minimize the makespan. Naval Research Logistics, 47(2), 128-144.</li> <li>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.</li> <li>Lin, B.M.T., & 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.</li> <li>Cheng*, T.C.E., Chen, Z.L., Li, C.L., & Lin, B.M.T. (1998). Single machine scheduling to minimize the sum of compression and late costs. Naval Research Logistics, 45(1), 67-82.</li> <li>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.</li> <li>Lin*, B.M.T. & Shyu, S.J. (1997). A random search strategy for the film production problem (in Chinese). MIS Review, 6, 17-26.</li> <li>Oguz, C., Lin, B.M.T., & Cheng*, T.C.E. (1997). Two-stage flowshop scheduling problem with a common second-stage machine. Computers and Operations Research, 24(12), 1169-1174.</li> <li>Tseng, S.S., Lin*, B.M.T., & Liu, S.H. (1997). Constructing N_\gamma Latin squares for \gamma \neq 2^\alpha. Journal of Information Science and Engineering, 13(4), 605-613.</li> <li>Cheng*, T.C.E., Kovalyov, M.Y., & 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.</li> <li>Cheng*, T.C.E., Chen, Z.L., Kovalyov, M.Y., & Lin, B.M.T. (1996). Parallel-machine batching and scheduling to minimize total completion time. IIE Transactions, 28(11), 953-956.</li> <li>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.</li> <li>Cheng*, T.C.E., Diamond, J.D., & 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.</li> <li>Lee*, C.Y., Cheng, T.C.E., & Lin, B.M.T. (1993). Minimizing the makespan in the three-machine assembly type flow shop problem. Management Science, 39(5), 616-625.</li> <li>Lin, B.M.T., & Tseng*, S.S. (1993). Generating the best K sequences in the relocation problems. European Journal of Operational Research, 69(1), 131-137.</li> <li>Lin, B.M.T., & 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.</li> <li>Lin, B.M.T., & Tseng*, S.S. (1991). Some results of relocation problems with processing times and deadlines. International Journal of Computer Mathematics, 41(1), 1-15.</li> </ol> </div> </div> </div><div class="ed_model18 clearfix"><button aria-controls="ed_model18_collapse17351251" aria-expanded="false" class="btn w-100 text-start d-flex justify-content-between" data-bs-target="#ed_model18_collapse17351251" data-bs-toggle="collapse" type="button"> <div class="ed-model18-title-text">其他著作</div> <div class="arrow"> <div> </div> </div> </button> <div class="collapse show" id="ed_model18_collapse17351251"> <div class="content"> <ol> <li>H.L. Huang and B.M.T. 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.</li> </ol> </div> </div> </div><div class="ed_model18 clearfix"><button aria-controls="ed_model18_collapse1676921" aria-expanded="false" class="btn w-100 text-start d-flex justify-content-between" data-bs-target="#ed_model18_collapse1676921" data-bs-toggle="collapse" type="button"> <div class="ed-model18-title-text">實驗室</div> <div class="arrow"> <div> </div> </div> </button> <div class="collapse show" id="ed_model18_collapse1676921"> <div class="content"><img alt="OTA 實驗室標誌" src="/userfiles/iimch/images/20260518123337739.png">　<strong>　最佳化理論與應用實驗室</strong><br>   <ul> <li><strong>實驗室介紹</strong> <ul> <li><strong>研究內容：</strong> <ul> <li>本實驗室探討各種排程以及最佳化理論之相關研究。會採用整數規劃、動態規劃等方法，以求得問題之最佳解。然而現實上所遇到的問題可能是十分複雜，難以用上述方法短時間求出最佳解，因此也會採用最佳化演算法，如：蟻群演算法(ACO)、模擬退火法(SA)、基因演算法(GA)…等，求取近似解。除了訓練思考邏輯以及解題技巧之外，也需要寫程式來驗證理論以及方法的效能與可行性。</li> </ul> </li> <li><strong>開會：</strong> <ul> <li>每學期的開會時間會彈性調整，會以老師跟學生皆有空的時段為主。過程採取討論式對談，氣氛和諧無壓力，僅特殊需求時會要求報告論文。</li> </ul> </li> <li><strong>活動：</strong> <ul> <li>實驗室會不定時與老師一起聚餐，偶爾也會參與其他實驗室舉辦的活動。除了玩樂性質的活動外，也有機會與老師所邀請的外國學者做學術上的交流互動。</li> </ul> </li> </ul> </li> <li><strong>實驗室方向</strong> <ul> <li>排程理論與應用</li> <li>最佳化理論與應用</li> </ul> </li> <li><strong>研究工具</strong> <ul> <li>解題工具：Gurobi</li> <li>編輯軟體：LaTex</li> <li>程式語言：不拘</li> </ul> </li> <li><strong>基礎需求</strong> <ul> <li>程式設計</li> <li>資料結構</li> <li>作業研究</li> <li>演算法</li> </ul> </li> <li><strong>可供聯絡之學長姐</strong> <ul> <li>蔡維怡 / <a href="mailto:vei.mg13@nycu.edu.tw" title="vei.mg13@nycu.edu.tw" id="6-2">vei.mg13@nycu.edu.tw</a></li> <li>周嘉城 / <a href="mailto:jczho.mg14@nycu.edu.tw" title="jczho.mg14@nycu.edu.tw" id="6-3">jczho.mg14@nycu.edu.tw</a></li> </ul> </li> </ul> </div> </div> </div>]]>https://iim.nycu.edu.tw/iim/ch/app/artwebsite/image?module=artwebsite&detailNo=1509061920768921600&init=YOTA花絮-5https://iim.nycu.edu.tw/iim/ch/app/artwebsite/image?module=artwebsite&detailNo=1509061920756338688&init=YOTA花絮-4https://iim.nycu.edu.tw/iim/ch/app/artwebsite/image?module=artwebsite&detailNo=1509061920735367168&init=YOTA花絮-3https://iim.nycu.edu.tw/iim/ch/app/artwebsite/image?module=artwebsite&detailNo=1509061920718589952&init=YOTA花絮-2https://iim.nycu.edu.tw/iim/ch/app/artwebsite/image?module=artwebsite&detailNo=1509061920697618432&init=YOTA花絮-1https://bmtlin.lab.nycu.edu.tw/個人網站