林妙聰

教授

研究室

管理二館MB310

校內分機

57052,31472

E-mail

bmtlin[at]mail.nctu.edu.tw

實驗室

最佳化理論與應用實驗室

個人網站

LINK

最佳化理論與應用實驗室

地點:管理二館MB313B

分機:57419

研究領域

排程理論

作業管理

離散最佳化

開授課程

排程理論與應用

高等演算法

演算法

教師學歷

  • 國立交通大學資訊工程學系博士

教師經歷

  • Director, Institute of Information Management, NCTU
  • Professor and Chair, Department of Information Management, National Chi Nan University
  • Professor and Chair, Department of Computer Science, Ming Chuan University
  • Associate Professor, Department of Information Management, Ming Chuan University
  • Visiting Scholar: (1) Department of Industrial & Operations Engineering, University of Michigan, (2) Department of Computer Science, NJIT, (3) Sobolev of Mathematics, Russian Academy of Sciences, (4) IBM T.J. Watson Research Center, N.Y.
  • Visiting Professor: (1) Faculty of Physical and Mathematical Sciences, University of Technology Sydney, (2) Warwick Business School, Warwick University
  • Senior Research Fellow: Department of Management, Hong Kong Polytechnic University
  • Associate Editor: (1) Journal of Scheduling, (2) Journal of Industrial and Management Operations, (3) Asia Pacific Journal of Operational Research
  • Editorial Board Member: (1) Computers and Operations Research, (2) International Journal of Production Economics, (3) International Journal of International Journal of Applied Metaheuristic Computing, (4) International Journal of Planning and Scheduling

研究領域

  • 排程理論
  • 作業管理
  • 離散最佳化

開授課程

  • 排程理論與應用
  • 高等演算法
  • 演算法
  • 資料結構

期刊論文

  • T.C.E. Cheng, B.M.T. Lin, and Y. Tian, Refurbishing flow shop scheduling to minimize the total completion time, accepted by International Journal of Production Research. (Invited paper for celebrating the 50th Anniversary of International Journal of Production Research)
  • T.F. Ho, Y.L. Wu, S.J. Shyu, and B.M.T. Lin, Discrete particle swarm optimization with scout particles for library materials acquisition, accepted by The Scientific World Journal (Operations Research division).
  • Y.C. Liu, K.T. Fang and B.M.T. Lin, A branch-and-bound algorithm for makespan minimization in differentiation flow shops, Engineering Optimization, DOI:10.1080/0305215X.2012.737783.
  • T.C. Huang and B.M.T. Lin, Batch scheduling in a differentiation flow shop to minimize the makespan, International Journal of Production Research, Vol. 51, No. 17, pp. 5073-5082.
  • B.M.T. Lin, P.Y. Yin and Y.S. Liu, Sequence-dependent scheduling with order deliveries, Applied Mathematics and Computation, Vol. 222, No. 1, pp. 58-71.
  • K.T. Fang and B.M.T. Lin, Parallel-machine scheduling to minimize tardiness penalty and power cost, Computers and Industrial Engineering, Vol. 64, No. 1, 2013, pp. 224-234.
  • B.M.T. Lin, Y.Y. Lin and K.T. Fang, Two-machine flow shop scheduling of polyurethane foam production, International Journal of Production Economics, Vol. 141, No. 1, 2013, pp. 286-294.
  • F.C. Lin, J.S. Hung and B.M.T. Lin, Sequence optimization for media objects with due date constraints in on-the-fly assembled multimedia presentations from digital libraries, Information Systems, Vol. 38, No. 1, 2013, pp. 82-96.
  • F.J. Hwang, M.Y. Kovalyov and B.M.T. Lin, Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence, Discrete Optimization, Vol. 9, No. 1, 2012, pp. 29-39.
  • F.J. Hwang and B.M.T. Lin, Assembly-type flowshop batch scheduling subject to a fixed job sequence, Journal of the Operational Research Society, Vol. 63, No. 6, 2012, pp. 839-845.
  • S.V. Sevastyanov, B.M.T. Lin and H.L. Huang, Minimizing the makespan in the relocation problem subject to release dates, Theoretical Computer Science, Vol. 39, 2011, pp. 1206-1212.
  • T.C.E. Cheng, B.M.T. Lin and H.L. Huang, Makespan minimization in the relocation problem with separate resource recycling operations, Computers & Operations Research, Vol. 39, 2012, pp. 1206-1212.
  • B.M.T. Lin and T.C.E. Cheng, Concurrent open shop scheduling with centralized and decentralized batching policies, Naval Research Logistics, Vol. 58, No. 1, 2011, pp. 17-27.
  • F.J. Hwang and B.M.T. Lin, Coupled-task scheduling with a fixed job sequence, Computers & Industrial Engineering, Vol. 60, No. 4, 2011, pp. 690-698.
  • B.M.T. Lin and F.J. Hwang, Total completion time minimization of fixed job sequences in a two-stage differentiation flowshop, Information Processing Letters, Vol. 111, 2011, pp. 208–212.
  • M.T. Chen, B.M.T. Lin and S.S. Tseng, An ant colony optimization for the dynamic routing and wavelength assignment in WDM networks with sparse wavelength conversion, Engineering Applications of Artificial Intelligence, Vol. 24, No. 2, 2011, pp. 295-305.
  • S. Gawiejnowicz and B.M.T. Lin, Scheduling time-dependent jobs under mixed deterioration, Applied Mathematics and Computation, Vol. 216, No. 2, 2010, pp. 438-447.
  • A.V. Kononov and B.M.T. Lin, The relocation problem to minimize the weighted completion time, Journal of Scheduling, Vol. 13, No. 2, 2009, pp. 123-129.
  • T.C.E. Cheng, B.M.T. Lin and Y. Tian, Minimizing weighted machine load in a two-stage flowshop with a common critical machine, Computers & Operations Research, Vol. 36, 2009, pp. 3031-3040.
  • F.C. Lin, J.S. Hung and B.M.T. Lin, Scheduling two-machine flowshops with continuous buffer constraints - An application to automatic multimedia presentation assembly, Computers & Operations Research, Vol. 36, 2009, pp. 1158-1175.
  • T.C.E. Cheng and B.M.T. Lin, Johnson’s rule, composite jobs and the relocation problem, European Journal of Operational Research, Vol. 192, No. 3, 2009, pp. 1008–1013.
  • B.M.T. Lin and S.T. Liu, Maximizing total reward in the relocation problem subject to generalized due dates, International Journal of Production Economics, Vol. 115, 2008, pp. 55-63.
  • B.M.T. Lin, C.Y. Lu, S.J. Shyu and C.Y. Tsai, New features of ant colony optimization for scheduling problems, International Journal of Production Economics, Vol. 112, 2008, pp. 742-755.
  • B.M.T. Lin and A.V. Kononov, Customer order scheduling to minimize the number of late orders, European Journal of Operational Research, Vol. 183, No. 2, 2007, pp. 944-948.
  • A.A.K. Jeng and B.M.T. Lin, A note on parallel-machine scheduling with deteriorating jobs, Journal of the Operational Research Society, Vol. 58, N. 6, 2006, pp. 824-826.
  • B.M.T. Lin, Complexity results on single-machine scheduling with positional learning effects, Journal of the Operational Research Society, Vol. 58, No. 8, 2007, pp. 1099-1102.
  • M.T. Chen, B.M.T. Lin and S.S. Tseng, Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities, Journal of Network and Computer Applications, Vol. 31, No. 1, 2008, pp 47-65.
  • B.M.T. Lin, T.C.E. Cheng and A.S.C. Chou, Scheduling in an assembly-type production chain with batch transfer, Omega, Vol. 35, 2007, pp. 143-151.
  • A.V. Kononov and B.M.T. Lin, On the relocation problems with multiple identical working crews, Discrete Optimization, Vol. 3, No. 4, 2006, pp. 368-381.
  • B.M.T. Lin and T.C.E. Cheng, Two-machine flowshop scheduling with time lags, International Transactions in Operational Research, Vol. 13, No. 2, 2006, pp. 1-8.
  • B.M.T. Lin and J.M. Wu, Bicriteria scheduling in a two-machine permutation flowshop, International Journal of Production Research, Vol. 44, No. 12, 2006, pp. 2299 – 2312.
  • M.T. Chen, S.S. Tseng, B.M.T. Lin, Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities, Computer Communications, Vol. 29, No. 9, 2006, pp. 1492-1503
  • B.M.T. Lin, F.C. Lin and R.C.T. Lee, Two-machine flowshop scheduling to minimize total late work, Engineering Optimization, Vol. 34, No. 4, 2006, pp. 501-509.
  • B.M.T. Lin and H.L. Huang, On the relocation problem with a second working crew for resource recycling, International Journal of Systems Science, Vol. 37, No. 1, 2006, pp. 27-34.
  • G.J. Hwang and T.L. Lin, and B.M.T. Lin, An effective approach for test-sheet composition from large-scale item banks, Computers & Education, Vol. 46, No. 2, 2006, pp. 122-139.
  • S.J. Shyu, B.M.T. Lin and T.S. Hsiao, Ant colony optimization algorithm for the cell assignment problem in PCS networks, Computers & Operations Research, Vol. 33, No. 6, 2006, pp 1713-1740.
  • B.M.T. Lin and J.M. Wu, A simple lower bound for two machine flowshop scheduling to minimize total completion time, Asia Pacific Journal of Operational Research, Vol. 22, No. 3, 2005, pp. 391-408.
  • G.J. Hwang, B.M.T. Lin, S.H. Tseng and T.L. Lin, On the development of a computer-assisted testing system with genetic test sheet-generating approach, IEEE Transactions on Systems, Man and Cybernetics: Part C, Vol. 35, No. 4, 2005, pp. 590- 594.
  • B.M.T. Lin and T.C.E. Cheng, Two-machine flowshop batching and scheduling, Annals of Operations Research, Vol. 133, 2005, pp. 149-161.
  • S.J. Shyu, B.M.T. Lin and P.Y. Yin, Applications of ant colony optimization for no-wait flowshop scheduling to minimize the total completion time, Computers & Industrial Engineering, Vol. 47, No. 2-3, 2004, pp. 181-193.
  • B.M.T. Lin and A.A.K Jeng, Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs, International Journal of Production Economics, Vol. 91, No. 2, 2004, 121-134
  • S.J. Shyu, P.Y. Yin and B.M.T. Lin, An ant colony optimization algorithm for the minimum weight vertex cover problem, Annals of Operations Research, Vol. 131, 2004, 283-304.
  • A.A.K. Jeng and B.M.T. Lin, Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs, Computers & Operations Research, Vol. 32, 2004, pp. 521-536.
  • B.M.T. Lin and J.M. Wu, Effective lower bounds for scheduling problems in two-stage hybrid flowshops, Journal of Management, Vol. 22, No. 3, 2004.
  • A.A.K. Jeng and B.M.T. Lin, Makespan minimization in single-machine scheduling with step-deterioration of processing times, Journal of the Operational Research Society, Vol. 55, 2004, pp. 247-256.
  • T.C.E. Cheng, Q. Ding and B.M.T. Lin, A concise survey of scheduling with time-dependent processing times, European Journal of Operational Research, Vol. 152, No. 1, 2003, pp. 1-13.
  • Y.H. Hsu and B.M.T. Lin, Algorithms for operations scheduling with linear deterioration, Omega, Vol. 31, No. 6, 2003, 459-469.
  • S.J. Shyu, P.Y. Yin, B.M.T. Lin and Haouari, Ant-Tree: An ant colony optimization approach to the generalized minimum spanning tree problem, Journal of Experimental and Theoretical Artificial Intelligence, Vol. 15, No. 1, 2003, pp. 103-112.
  • Y.S. Huang and B.M.T. Lin, An empirical study on TQM implementation in Taiwan, TQM Magazine, Vol. 14, No. 3, 2002, pp. 172-180.
  • B.M.T. Lin and T.C.E. Cheng, Fabrication and assembly scheduling in a two-machine flowshop, IIE Transactions, Vol. 34, No. 11, 2002, pp. 1015-1020.
  • B.M.T. Lin, Fabrication scheduling in a two-machine flowshop with due date constraints, European Journal of Operational Research, Vol. 136, No. 1, 2002, pp. 95-105.
  • B.M.T. Lin, H.K. Yu and Y.S. Huang, A heuristic algorithm for the generalized assignment problem, International Journal of Computer Mathematics, Vol. 77, No. 4, 2001, pp. 535-561.
  • B.M.T. Lin and T.C.E. Cheng, Batch scheduling in a no-wait two-machine flowshop, Computers & Operations Research, Vol. 28, No. 7, 2001, pp. 613-624.
  • B.M.T. Lin, Scheduling in a two-machine flowshop with due date constraints, International Journal of Production Economics, Vol. 70, No.2, 2001, pp. 117-123.
  • S.J. Shyu and B.M.T. Lin, An application of PVM framework to film production problem, Computers & Mathematics with Applications, Vol. 39, No. 12, 2000, pp. 53-62.
  • T.C.E. Cheng, B.M.T. Lin and A. Toker, Flowshop batching and scheduling to minimize the makespan, Naval Research Logistics, Vol. 47, No. 2, 2000, pp. 128-144.
  • B.M.T. Lin, A new branch-and-bound algorithm for the film production problem (in Chinese), Journal of Ming Chuan University, Vol. 10, No. 1, 1999, pp. 101-110.
  • B.M.T. Lin and T.C.E. Cheng, Relocation problems to minimize the maximum tardiness and the number of tardy jobs, European Journal of Operational Research, Vol. 116, No. 1, 1999, pp. 183-193.
  • T.C.E. Cheng, Z.L. Chen, C.L. Li and B.M.T. Lin, Single machine scheduling to minimize the sum of compression and late costs, Naval Research Logistics, Vol. 45, 1998, pp. 67-82.
  • B.M.T. Lin, On the strong NP-hardness of two-stage flowshop scheduling problem with a common second-stage machine, Computers & Operations Research, Vol. 26, No. 7, 1999, 695-698.
  • B.M.T. Lin and S.J. Shyu, A random search strategy for the film production problem (in Chinese), MIS Review, Vol. 6, 1997, pp. 17-26.
  • C. Oguz, B.M.T. Lin and T.C.E. Cheng, Two-stage flowshop scheduling problem with a common second-stage machine, Computers & Operations Research, Vol. 24, No. 12, 1997, pp. 1169-1174.
  • S.S. Tseng, B.M.T. Lin and S.H. Liu, Constructing N Latin squares for   2, Journal of Information Science and Engineering, Vol. 13, 1997, pp. 605-613.
  • T.C.E. Cheng, M.Y. Kovalyov and B.M.T. Lin, Single machine scheduling to minimize the batch delivery and job earliness penalty, SIAM Journal on Optimization, Vol. 7, No. 2, 1997, pp. 547-559.
  • T.C.E. Cheng, Z.L. Chen, M.Y. Kovalyov and B.M.T. Lin, Parallel-machine batching and scheduling to minimize total completion time, IIE Transactions, Vol. 28, 1996, pp. 953-956.
  • B.M.T. Lin, On finding the most vital job in relocation problems, Journal of the Operations Research Society of Japan, Vol. 37, No. 3, 1994, pp. 182-187.
  • T.C.E. Cheng, J. Diamond and B.M.T. Lin, Optimal scheduling in film production to minimize talent hold cost, Journal of Optimization Theory and Applications, Vol. 79, No. 3, 1993, pp. 197-206.
  • C.Y. Lee, T.C.E. Cheng and B.M.T. Lin, Minimizing the makespan in the three-machine assembly type flow shop problem, Management Science, Vol. 39, No. 5, 1993, pp. 616-625.
  • B.M.T. Lin and S.S. Tseng, Generating the best K sequences in the relocation problems, European Journal of Operational Research, Vol. 69, No. 1, 1993, pp. 131-137.
  • B.M.T. Lin and S.S. Tseng, On the relocation problems of maximizing new capacities under a common due-date, International Journal of Systems Science, Vol. 23, No. 9, 1992, pp. 1433-1448.
  • B.M.T. Lin and S.S. Tseng, Some results of relocation problems with processing times and deadlines, International Journal of Computer Mathematics, Vol. 41, No. 1, 1991, pp. 1-15.

研討會論文

  • C.Y. Lee, T.C.E. Cheng and B.M.T. Lin, Minimizing the makespan in three-machine assembly type flow shop problem, Management Science, Vol. 39, No. 5, 1993, pp. 616-625.
  • T.C.E. Cheng, J. Diamond and B.M.T. Lin, Optimal scheduling in film production to minimize talent hold cost, Journal of Optimization Theory and Applications, Vol. 79, No. 3, 1993, pp. 197-206.
  • T.C.E. Cheng, Z.L. Chen, M.Y. Kovalyov and B.M.T. Lin, Parallel-machine batching and scheduling to minimize total completion time, IIE Transactions, Vol. 28, 1996, pp. 953-956.
  • T.C.E. Cheng, Z.L. Chen, C.L. Li and B.M.T. Lin, Single machine scheduling to minimize the sum of compression and late costs, Naval Research Logistics, Vol. 45, 1998, pp. 67-82.
  • T.C.E. Cheng, B.M.T. Lin and A. Toker, Flowshop batching and scheduling to minimize the makespan, Naval Research Logistics, Vol. 47, No. 2, 2000, pp. 128-144.
  • B.M.T. Lin and T.C.E. Cheng, Fabrication and assembly scheduling in a two-machine flowshop, IIE Transactions, Vol. 34, No. 11, 2002, pp. 1015-1020.
  • S.J. Shyu, B.M.T. Lin and P.Y. Yin, An ant colony optimization algorithm for the minimum weight vertex cover problem, Annals of Operations Research, Vol. 131, 2004, 283-304.
  • B.M.T. Lin and J.M. Wu, Effective lower bounds for scheduling problems in two-stage hybrid flowshops, Journal of Management (管理學報), June 2004.
  • B.M.T. Lin and T.C.E. Cheng, Two-machine flowshop batching and scheduling, Annals of Operations Research, Vol. 133, 2005, pp. 149-161.
  • G.J. Hwang and T.L. Lin, and B.M.T. Lin, An effective approach for test-sheet composition from large-scale item banks, Computers & Education, Vol. 46, No. 2, 2005, pp. 122-139.
  • A.V. Kononov and B.M.T. Lin, On the relocation problems with multiple identical working crews, Discrete Optimization, Vol. 3, No. 4, 2006, pp. 368-381.
  • B.M.T. Lin, Complexity results on single-machine scheduling with positional learning effects, Journal of the Operational Research Society, Vol. 58, No. 8, 2007, pp. 1099-1102.
  • B.M.T. Lin and A.V. Kononov, Customer order scheduling to minimize the number of late orders, European Journal of Operational Research, Vol. 183, No. 2, 2007, pp. 944-948.
  • T.C.E. Cheng and B.M.T. Lin, Johnson rule, composite jobs and the relocation problem, accepted by European Journal of Operational Research, 2007.

其他著作

  • 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.

實驗室介紹

1. 研究內容:

       本實驗室探討各種排程以及最佳化理論之相關研究。會採用整數規劃、動態規劃等方法,以求得問題之最佳解。然而現實上所遇到的問題可能是十分複雜,難以用上述方法短時間求出最佳解,因此也會採用最佳化演算法,如:蟻群演算法(ACO)、模擬退火法(SA)、基因演算法(GA)…等,求取近似解。除了訓練思考邏輯以及解題技巧之外,也需要寫程式來驗證理論以及方法的效能與可行性。


2. 開會:

      每學期的開會時間會彈性調整,會以老師跟學生皆有空的時段為主。過程採取討論式對談,氣氛和諧無壓力,僅特殊需求時會要求報告論文。


3. 活動:

      實驗室會不定時與老師一起聚餐,偶爾也會參與其他實驗室舉辦的活動。除了玩樂性質的活動外,也有機會與老師所邀請的外國學者做學術上的交流互動。

實驗室方向

排程理論與應用
最佳化理論與應用

研究工具

解題工具:Gurobi
編輯軟體:LaTex
程式語言:不拘

基礎需求

程式設計
資料結構
作業研究
演算法

可供聯絡之學長姊

林冠廷 / inazuma184@hotmail.com
郝柏茜 / star83424.dif01@g2.nctu.edu.tw

實驗室花絮