Lin, Bertrand M.T.
中文- Publish Date：2024-12-13
- Update Date：2025-04-24
- Units：Institute of Hospital and Health Care Administration
Lin, Bertrand M.T.
MB310, Management Building 2, Guangfu Campus
+886-2-2826-7000 #31472
Academic Degrees- Ph.D., Computer Science and Information Engineering, NCTU
- M.S. Computer and Information Science, NCTU
- B.S. Information Science, NCTU
Experience- Professor, Director, Institute of Information Management, NYCU
- Professor, Department of Information Management and Finance, NCTU
- Professor, Chair, Department of Information Management, National Chi Nan University
- Professor, 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, The Hong Kong Polytechnic University
- Area editor, NTU Management Review (12/2022~)
- Associate editor, Asia-Pacific Journal of Operational Research (09/2008~)
- Associate editor, Journal of Industrial and Management (04/2011 ~)
- Associate Editor, Journal of Scheduling (02/2012 ~)
- Area Editor, Computers & Industrial Engineering (05/2020 ~)
Research InterestsScheduling Theory, Operations Management, Discrete Optimization
Ongoing Research Grants- Flow-Shop Scheduling to Maximize the Total Weighted Early Work (NSTC 112-2410-H-A49 -014 -MY2)
- Single-Machine Scheduling with Weight Modifying Activities (MOST110-2410-H-A49-020-MY2)
- Deploying Reinforced Learning to Enhance Search Effectiveness of Meta-Heuristics (Co-PI) ITRI 工研院
- A Metric Approach for Analyzing the Performance of Approximation Algorithms for NP-Hard Scheduling Problems (PI) (MOST109-2923-H-009-001-MY3)
- Minimizing the Salvage Time in Relocation Scheduling (PI) (MOST 109-2410-H-009-029)
- Preemptive Scheduling on Parallel Machines with Min-Sum Objective Functions (PI) (MOST-108-2410-H-009-047-MY2)
Selected Publications- Lin, B.M.T., Liu, S.W. & Mosheiov, G. (2024). Scheduling with a weight-modifying activity to minimize the total weighted completion time. Accepted by Omega.
- Li, H.L., Fang, S.C., Lin, B.M.T., & Kuo, W. (2023). Unifying colors by primes. Light: Science and Applications, 12(1), 32.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
