博士生Supervised Ph.D. Theses:

黃鋒樟Feng-Jang Hwang: January 2011

Scheduling Problems Subject to Fixed Job Sequences

黃筱嵐 Hsiao-Lan Huang: February 2011

Makespan Minimization in the Relocation Problem on a Single Machine 

方癸棠 Kwei-Tang Fang: July 2013

Scheduling with Supporting Operations

吳怡菱Yi-Ling Wu: June, 2014

Optimization for Library Materials Acquisition Problems

蔡彥興 Yen-Shing Tsai: August 2016

Bin Packing and Bin Covering of Subsets

洪懷哲 Hui-Che Hong: April 2019

Parallel Dedicated Machines Scheduling with Resource Constraints

江惠儀 Hui-Yi Chiang: August 2020

A Decision Model for Human Resource Allocation in Project Management of Software Development

林子靖 Tzu-Chin Lin: September 2025

Case Studies of Shift and Production Scheduling in Optical Industry

 

 

Selected Journal Papers: 

*: Correspondence Author

001.  Lin, T.Z., & Lin*, B.M.T. (2026). Scheduling optimization of optical lens polishing. To appear in International Transactions in Operational Research. https://doi.org/10.1111/itor.70162.

002.  Tsen, H.P., Cheng, C.Y. & Lin*, B.M.T. (2026). Trusting online shopping reviews: Combinations, intervals, and temporal distance. Management Decision. https://doi.org/10.1108/MD-03-2025-0594.

003.  Yang, Z., Tanaka, S. & Lin*, B.M.T. (2025). Talent scheduling with daily working capacity and scene changeover times. Omega, https://doi.org/10.1016/j.omega.2025.103439.

004.  Yu, R., Oron*, D. & Lin, B.M.T. (2025). Single-machine and flow-shop scheduling with supporting tasks in a nested structure. Journal of Scheduling, https://doi.org/10.1007/s10951-025-00855-y.

005.  Chen*, P.A., Wang, L.W., Lin, B.M.T., Cheng, Y.W., & Chen, C.H. (2025). Tight bounds on the weak price of anarchy for the randomized externality policy in scheduling games with multi-job players. Journal of the Operational Research Society, https://doi.org/10.1080/01605682.2025.2518549.

006.   Elidrissi, A., Gupta*, J.N.D., Benmansour, R. & Lin, B.M.T. (2025). A reduction approach for the parallel machine scheduling problem with a separate server for loading and unloading operations. European Journal of Operational Research, https://doi.org/10.1016/j.ejor.2025.05.030.

007.  Tanaka, S. & Lin*, B.M.T. (2025). Single-machine scheduling to minimize the size of input buffer. Naval Research Logistics, https://doi.org/10.1002/nav.22256.

008.  Huang, C.T., Hsieh*, T.J., Lin, B.M.T. (2025). Data-driven scheduling for the photolithography process in semiconductor manufacturing. Journal of Industrial and Management Optimization, 21(3), 1946-1963. https://doi.org/10.3934/jimo.2024157

009.  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. https://doi.org/10.1016/j.omega.2024.103115.

010.  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. https://doi.org/10.1080/01605682.2023.2203150

011.  Zinder, Y., Berlińska*, J., Lin, B.M.T. (2024), Scheduling jobs with shared additional operations on parallel identical machines. Computers and Operations Research, 170, 106780. https://doi.org/10.1016/j.cor.2024.106780.

012.  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. https://doi.org/10.1002/nav.22076

013.  Su, Y.C. & Lin*, B.M.T. (2022). Minimizing the total weighted completion time in relocation scheduling. Computers & Industrial Engineering, 108662. https://doi.org/10.1016/j.cie.2022.108662

014.  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. https://doi.org/10.1016/j.ejor.2021.07.055

015.  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. https://doi.org/10.1080/01605682.2020.1779625

016.  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. https://doi.org/10.1016/j.cie.2021.107121

017.  Agnetis, A., Gawiejnowicz*, S., Lin, B.M.T., & G. Mosheiov (2020). Editorial: Dynamic Scheduling Problems. Journal of Scheduling, 1-2.

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

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

020.  Kononov, A.V., Kovalyov, M.Y., & Lin*, B.M.T. (2019). Minimizing machine assignment costs over $\Delta$-approximate solutions of the scheduling problem P||C_max. Theoretical Computer Science, 793, 70-78.

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

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

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

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

025.  Hong, H.C., & Lin*, B.M.T. (2018). Parallel dedicated machine scheduling with conflict graphs. Computers & Industrial Engineering, 124, 316-321.

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

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

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

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

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

031.  Lu, Y.T., Fang, K.T., & Lin*, B.M.T. (2017). Banner advertisement scheduling to maximize space utilization. International Journal of Operations Research, 13(3), 102-120.

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

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

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

035.  Lin*, B.M.T. (2015). Resource-constrained scheduling with optional recycling operations. Computers & Industrial Engineering, 90, 39-45.

036.  Kononov, A.V., Lin*, B.M.T., & Fang, K.T. (2015). Single-machine scheduling with supporting tasks. Discrete Optimization, 17, 69-79.

037.  Lin,* B.M.T. (2015). Two-stage flow shop scheduling with dedicated machines. International Journal of Production Research, 53(4), 1094-1097.

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

039.  Hwang, F.J., Kovalyov, M.Y., & Lin*, B.M.T. (2014). Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence. Annals of Operations Research, 217(1), 263-279.

040.  Cheng, T.C.E., Lin*, B.M.T., & Tian, Y. (2014). Refurbishing flow shop scheduling to minimize the total completion time. International Journal of Production Research, 51(23-24), 7120-7139. (Invited paper for the 50^th Anniversary of IJPR).

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

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

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

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

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

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

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

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

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

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

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

052.  Hwang, F.J., & Lin*, B.M.T. (2012). Coupled-task scheduling with a fixed job sequence. Computers & Industrial Engineering, 60(4), 690-698.

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

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

055.  Gawiejnowicz*, S., & Lin, B.M.T. (2010). Scheduling time-dependent jobs under mixed deterioration. Applied Mathematics and Computation, 216(2), 438-447.

056.  Kononov, A.V. & Lin*, B.M.T. (2009). Minimizing the total weighted completion time in the relocation problem. Journal of Scheduling, 13(2), 123-129.

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

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

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

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

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

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

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

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

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

066.  Lin*, B.M.T., Cheng, T.C.E., & A.S.C. Chou, A.S.C. (2007). Scheduling in an assembly-type production chain with batch transfer. Omega,  35(2), 143-151.

067.  Kononov, A.V. & Lin*, B.M.T. (2006). On the relocation problems with multiple identical working crews. Discrete Optimization, 3(4), 366-381.

068.  Lin,* B.M.T. & Cheng, T.C.E. (2006). Two-machine flowshop scheduling with time lags. International Transactions in Operational Research, 13(2), 1-8.

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

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

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

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

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

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

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

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

077.  Lin,* B.M.T. & Cheng, T.C.E. (2005). Two-machine flowshop batching and scheduling. Annals of Operations Research, 133 (1-4), 149-161.

078.  Shyu, S.J., Lin, B.M.T., & 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.

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

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

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

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

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

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

085.  Hsu, Y.H. & Lin*, B.M.T. (2003). Algorithms for operations scheduling with linear deterioration. Omega, 31(6), 459-469.

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

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

088.  Lin, B.M.T. & Cheng, T.C.E. (2002). Fabrication and assembly scheduling in a two-machine flowshop. IIE Transactions, 34(11), 1015-1020.

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

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

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

092.  Lin*, B.M.T. (2001). Scheduling in a two-machine flowshop with due date constraints. International Journal of Production Economics, 70(2), 117-123.

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

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

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

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

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

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

099.  Tseng*, S.S., Lin, B.M.T., & Liu, S.H. (1997). Constructing $N_{\gamma}$ Latin squares for $gamma\not=2^{\alpha}$. Journal of Information Science and Engineering, 13(4), 605-613.

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

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

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

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

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

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

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

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

 

 

Refereed Conference Papers/Presentations: 

01.  Efficient enumeration of optimal and approximate solutions of the two-machine flowshop problem, The 13th International Workshop on Project Management and Scheduling (MAPSP 2011), June 19-24, Nymburk, Czech Republic. (with S. V. Sevastyanov)

02.  Resource-constrained scheduling with two parallel dedicated machines subject to fixed processing sequences, The 24th Conference of the European Chapter on Combinatorial Optimization (ECCO), May 30-June 1, Amsterdam, the Netherlands. (with A.V. Kononov and F.J. Hwang)

03.  Lower bounds for hold cost minimization in talent scheduling, The 4^th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2011), April 16-17, 2011, Hsinchu, Taiwan. (with T.C.E. Cheng)

04.  Resource-constrained scheduling to minimize the total weighted completion time. The 12th International Workshop on Project Management and Scheduling (PMS 2010), April, 2010, Tours, France. (with A.V. Kononov)

05.  Two-machine flowshop scheduling with supportive constraints, The 40^th International Conference on Computers & Industrial Engineering (CIE40), July 25-28, Awaji, Japan. (with Y.Y. Lin)

06.  Minimization of total completion time in flowshop scheduling subject to fixed job sequences. The 12th International Workshop on Project Management and Scheduling (PMS 2010), April, 2010, Tours, France. (with M.Y. Kovalyov and F.J. Hwang)

07.  Time-dependent scheduling with mixed job processing times. The 12th International Workshop on Project Management and Scheduling (PMS 2010), April, 2010, Tours, France. (with S. Gawiejnowicz)

08.  Scheduling in parallel flow shops. The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2009), July 2009, Abbey Rolduc, The Netherlands. (with S.V. Sevastyanov and F.J. Hwang)

09.  A Tabu search algorithm for the film production problem. The 2005 SIAM Conference on Computational Science and Engineering, , February 2005, Orlando, Florida. (with X.L. Huang, F.C. Lin and R.C.T. Lee)

10.  Minimizing Total Late Work on a Single Machine with Release and Due Dates. The 2005 SIAM Conference on Computational Science and Engineering, February 2005, Orlando, Florida. (with S.W. Hsu)

11.  NP-hardness and non-approximability of the relocation problems with identical parallel machines. The 9th International Workshop on Project Management and Scheduling (PMS), Nancy, France, pp. 48-51, April, 2004. (with A. Kononov)

12.  An ant algorithm for cell assignment in PCS networks. The 2004 IEEE International Conference on Networking, Sensing and Control. (with S.J. Shyu and T.S. Hsiao)

13.  Branch-and-bound algorithm for minimizing weighted tardiness in a two-machine flowshop. The 18th International Symposium on Mathematical Programming, August 2003, Denmark. (with K. Chen)

14.  Batching and scheduling in a two-machine flowshop. The 5th International Conference on Optimization: Techniques and Applications (ICOTA), Hong Kong, December 2001. (with T.C.E. Cheng)

15.  An application of ant colony systems to no-wait flowshop scheduling. The INFORMS Meeting, Maui, Hawaii, June, 2001. (with P.Y. Yin and S.J. Shyu) 

16.  Fabrication scheduling to minimize the maximum tardiness and the number of tardy jobs. The INFORMS-Seoul 2000 Conference, Seoul, Korea, June 2000. 

17.  Scheduling in a two-machine no-wait flowshop scheduling with batch considerations. The INFORMS-Seoul 2000 Conference, Seoul, Korea, June 2000. (with T.C.E. Cheng)

18.  Minimizing the makespan in a two-machine flowshop with fabrication and assembly operations. The IFIP TC7 Conference on System Modeling and Optimization, July 1999, Cambridge, U.K. (with T.C.E. Cheng) 

19.  On the NP-hardness of the two-machine relocation problem of makespan minimization. The 6th INFORMS Computer Science Section Conference, California, USA, January 1998. (with T.C.E. Cheng)