Lin, Bertrand M.T.
Lin, Bertrand M.T.
Laboratory on-campus extension email laboratory personal website
Professor
Management Hall 2 MB310
57410, 31472
bmtlin@nycu.edu.tw
Optimization Theory and Applications Lab
LINK
Optimization Theory and Applications Lab
Office: MB313B, Management Building 2
Extension: 57419
Research
Scheduling Theory
Operations Management
Discrete Optimization
Courses
Scheduling Theory and Applications
Advanced Computer Algorithms
Algorithms
Data Structure
Academic Background |
---|
PhD, Department of Information Engineering, National Chiao Tung University |
Department of Information Science, National Chiao Tung University |
Curriculum Vitae | A visiting scholar | Visiting professor | Senior Research Fellow | Journal editing services | Resign |
---|---|---|---|---|---|
Director, Institute of Information Management, National Chiao Tung University | Department of Industrial & Operations Engineering, University of Michigan | Faculty of Physical and Mathematical Sciences, University of Technology Sydney | Department of Management, The Hong Kong Polytechnic University | Area editor, NTU Management Review NTU Management Review (12/2022~) | Area editor, Sun Yat-Sen Management ReviewZhongshan Management Review(01/2017~07/2019) |
Professor, Department of Information Management and Finance, National Chiao Tung University | Department of Computer Science, NJIT | Warwick Business School, Warwick University | Associate editor, Asia-Pacific Journal of Operational Research (09/2008~) | Editorial board member, International Journal of Production Economics (04/2008~02/2021) | |
Professor and Head of Department of Information Management, National Jinan University | Sobolev of Mathematics, Russian Academy of Sciences | Associate editor, Journal of Industrial and Management Optimization (04/2011~) | Editorial advisory board member, Computers and Operations Research (01/2006~09/2019) | ||
Professor and Head of Department of Information Science, Mingchuan University | IBM TJ Watson Research Center, NY | Associate editor, Journal of Scheduling (02/2012-) | Editorial board member, International Journal of Operations Research (05/2004~10/2008) | ||
Associate Professor, Department of Information Management, Ming Chuan University | Area Editor, Computers & Industrial Engineering (05/2020~) | ||||
Editorial board member, Journal of Applied and Industrial Mathematics, affiliated with Discrete Analysis and Operations Research in Russian (10/2015~) | |||||
Editorial board member, Social Sciences & Humanities Open (10/2018~) | |||||
Editorial board member, International Journal of Planning and Scheduling (09/2009~) | |||||
Editorial review board member, International Journal of Applied Metaheuristic Computing (11/2008~) |
Journal Paper |
---|
Dolgui, A., Kovalyov, MY, & Lin, BMT* (2022). Maximizing total early work in a distributed two-machine flow-shop. Naval Research Logistics, 69(8), 1124-1137. |
Chen, X., Miao, Q., Lin, BMT*, Sterna, M., Blazewicz, J. (2021). Two-machine flow shop scheduling with a common due date to maximize total early work. European Journal of Operational Research , 300(2), 504-511. |
Cheng, TCE, Kravchenko, SA, & Lin, BMT*(2021). Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences. Journal of the Operational Research Society, 72(10), 2286-2289. |
Hao, PC & Lin, BMT* (2021). Text mining approach for bottleneck detection and analysis in printed circuit board manufacturing. Computers & Industrial Engineering, 154, 107121. |
Agnetis, A., Gawiejnowicz, S.*, Lin, BMT, & G. Mosheiov (2020). Editorial: Dynamic Scheduling Problems. Journal of Scheduling, 1-2. |
Kononov, AV, Kovalyov, MY, & Lin, BMT* (2019). Minimizing machine assignment costs over -approximate solutions of the scheduling problem P||Cmax. Theoretical Computer Science, 793, 70-78. |
Hung, HC, Lin, BMT*, Posner, ME, & Wei, JM (2019). Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. Journal of Scheduling, 22(4), 413-431. |
Cheng, TCE Kravchenko, SA, & Lin, BMT* (2019). Server scheduling on parallel dedicated machines with fixed job sequences. Naval Research Logistics, 66(4), 321-332. |
Hwang, FJ, & Lin, BMT* (2018). Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines. Computers and Operations Research, 98, 103-112. |
Cheng, TCE, Kravchenko, SA, & Lin, BMT* (2017). Preemptive parallel-machine scheduling with a common server to minimize makespan. Naval Research Logistics, 64 (5), 355-434. |
Lin, BMT*, Hwang, FJ, & Gupta, JND (2017). Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence. Journal of Scheduling, 20(3), 293-302. |
Yang, CN, Lin, BMT*, Hwang, FJ, & Wang, MC (2016). Acquisition planning and scheduling of computing resources. Computers and Operations Research, 76, 167-182. |
Tsai, YS, & Lin, BMT* (2016). Flow shop non-idle scheduling and resource-constrained scheduling. Annals of Operations Research, 238(1-2), 577-585. |
Lin, BMT*, Hwang, FJ, & Kononov, AV (2016). Relocation scheduling subject to fixed processing sequences. Journal of Scheduling, 19(2), 153-163. |
Lin, BMT* (2015). Resource-constrained scheduling with optional recycling operations. Computers & Industrial Engineering, 90, 39-45. |
Kononov, AV, Lin, BMT*, & Fang, KT (2015). Single-machine scheduling with supporting tasks. Discrete Optimization, 17, 69-79. |
Lin, BMT* (2014). Two-stage flow shop scheduling with dedicated machines. International Journal of Production Research, 53(4), 1094-1097. |
Lee, K.*, Leung, JYT, Jia, JH, Li, W., Pinedo, ML, & Lin, BMT (2014) Fast approximation algorithms for bi-criteria scheduling with machine assignment costs. European Journal of Operational Research, 238 (1), 53-64. |
Hwang, FJ, Kovalyov, MY, & Lin, BMT* (2014). Scheduling for fabrication & assembly in a two-machine flowshop with a fixed job sequence. Annals of Operations Research, 217(1), 263-279. |
Lin, BMT*, Lin, YY, & Fang, KT (2013). Two-machine flow shop scheduling of polyurethane foam production. International Journal of Production Economics, 141(1), 286-294. |
Hwang, FJ, Kovalyov, MY, & Lin, BMT* (2012). Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. Discrete Optimization, 9(1), 29-39. |
Cheng, TCE, Lin, BMT*, & Huang, HL (2012). Resource-constrained flowshop scheduling with separate resource recycling operations. Computers and Operations Research, 39(6), 1206-1212. |
Sevastyanov, SV, Lin, BMT*, & Huang, HL (2011). Time complexity analysis in the relocation problem with arbitrary release dates. Theoretical Computer Science, 412(35), 4536-4544. |
Lin, BMT*, & Cheng, TCE (2012). Concurrent open shop scheduling with centralized and decentralized batching policies. Naval Research Logistics, 58(1), 17-27. |
Kononov, AV & Lin, BMT* (2010). Minimizing the total weighted completion time in the relocation problem. Journal of Scheduling, 13(2), 123-129. |
Cheng, TCE, Lin, BMT*, & 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. |
Lin, FC, JS Hung, JS*, & Lin, BMT (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 . |
Cheng, TCE & Lin, BMT*. (2009). Johnson's rule, composite jobs and the relocation problem. European Journal of Operational Research, 192(3), 1008–1013. |
Lin, BMT*, Lu, CY, Shyu, S..J., & Tsai, CY (2008). Development of new features of ant colony optimization for scheduling problems. International Journal of Production Economics, 112(2), 742- 755. |
Lin, BMT* & Liu, ST (2008). Maximizing total reward in the relocation problem subject to generalized due dates. International Journal of Production Economics, 115(1), 55-63. |
Lin, BMT* & Kononov, AV (2007). Customer order scheduling to minimize the number of late orders. European Journal of Operational Research, 183(2), 944-948. |
Lin, BMT*, Cheng, TCE & ASC Chou, ASC (2007). Scheduling in an assembly-type production chain with batch transfer. Omega, 35(2), 143-151. |
Lin, BMT (2007). Complexity results on single-machine scheduling with positional learning effects, Journal of the Operational Research Society, Vol. 58, No. 8, pp. 1099-1102. |
Kononov, AV & Lin, BMT* (2006). On the relocation problems with multiple identical working crews. Discrete Optimization, 3(4), 366-381. |
Lin, BMT* & Wu, JM (2006). Bicriteria scheduling in a two-machine permutation flowshop. International Journal of Production Research, 44(12), 2299-2312. |
Shyu, SJ*, Lin, BMT, & Hsiao, TS (2006). Ant colony optimization algorithm for the cell assignment problem in PCS networks. Computers and Operations Research, 33(6), 1713-1740. |
Lin, BMT* & Cheng, TCE (2005). Two-machine flowshop batching and scheduling. Annals of Operations Research, 133 (1-4), 149-161. |
Hwang, GJ, Lin, TL & Lin, BMT (2005). An effective approach for test-sheet composition from large-scale item banks, Computers & Education, Vol. 46, No. 2, pp. 122-139. |
Lin, BMT* & Jeng, AAK (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 |
Shyu, SJ, Yin, PY, & Lin, BMT* (2004). An ant colony optimization algorithm for the minimum weight vertex cover problem. Annals of Operations Research, 131(1-4), 283-304. |
Jeng, AAK & Lin, BMT* (2004). Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs. Computers and Operations Research, 32(3), 521-536. |
Cheng, TCE*, Ding, Q., & Lin, BMT (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152(1), 1-13. |
Lin, BMT & Wu, JM (2004). Effective lower bounds for scheduling problems in two-stage hybrid flowshops, Journal of Management. |
Hsu, YH & Lin, BMT* (2003). Algorithms for operations scheduling with linear deterioration. Omega, 31(6), 459-469. |
Lin, BMT & Cheng, TCE* (2002). Fabrication and assembly scheduling in a two-machine flowshop. IIE Transactions, 34(11), 1015-1020. |
Lin, BMT* (2002). Fabrication scheduling in a two-machine flowshop with due date constraints. European Journal of Operational Research, 136(1), 95-105. |
Lin, BMT, & Cheng, TCE* (2001). Batch scheduling in a no-wait two-machine flowshop. Computers and Operations Research, 28(7), 613-624. |
Lin, BMT* (2001). Scheduling in a two-machine flowshop with due date constraints. International Journal of Production Economics, 70(2), 117-123. |
Cheng, TCE*, Lin, BMT, & Toker, A. (2000). Flowshop batching and scheduling to minimize the makespan. Naval Research Logistics, 47(2), 128-144. |
Lin, BMT, & Cheng, TCE*, Relocation problems to minimize the maximum tardiness and the number of tardy jobs. European Journal of Operational Research, 116(1), 183-193. |
Cheng, TCE*, Chen, ZL, Li, CL, & Lin, BMT (1998). Single machine scheduling to minimize the sum of compression and late costs. Naval Research Logistics, 45(1), 67-82. |
Oguz, C., Lin, BMT, & Cheng, TCE* (1997). Two-stage flowshop scheduling problem with a common second-stage machine. Computers and Operations Research, 24(12), 1169-1174. |
Cheng, TCE*, Kovalyov, MY, & Lin, BMT (1997). Single machine scheduling to minimize the batch delivery and job earliness penalty. SIAM Journal on Optimization, 7(2), 547-559. |
Cheng, TCE*, Chen, ZL, Kovalyov, MY, & Lin, BMT (1996). Parallel-machine batching and scheduling to minimize total completion time. IIE Transactions, 28(11), 953-956. |
Cheng, TCE, Diamond, J. & Lin, BMT (1993). Optimal scheduling in film production to minimize talent hold cost, Journal of Optimization Theory and Applications, Vol. 79, No. 3, pp. 197-206. |
Lee, CY*, Cheng, TCE, & Lin, BMT (1993). Minimizing the makespan in the three-machine assembly type flow shop problem. Management Science, 39(5), 616-625. |
Others |
---|
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. |
Laboratory introduction
Research:
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 “hard” 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)….
Meeting:
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.
Activity:
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.