Dr. Kuo-Ching Ying

Professor
National Taipei University of Technology, Taiwan

Highest Degree
Ph.D. in Industrial Management from National Taiwan University of Science and Technology, Taiwan

My URL
https://livedna.org/886.9813

Share this Profile

Biography

Dr. Kuo-Ching Ying holds a position of Professor at Department of Industrial Engineering and Management National Taipei University of Technology. He earned his Ph.D. in Industrial Management from National Taiwan University of Science and Technology. He is editor for various journals such as Advances in Industrial Engineering and Management, Advanced Studies in Artificial Intelligence, Far East Journal of Experimental and Theoretical Artificial Intelligence, International Scholarly Research Notices, Journal of the Chinese Institute of Industrial Engineers, The Scientific World Journal, and Journal of Algorithms and Optimization. Dr. Kuo-Ching Ying’s research is focused on the Production Scheduling. He has published 70 research articles in journals contributed as author/co-author.

Area of Interest:

Business Management and Accounting
Production Scheduling
Applied Intelligence
Applied Soft Computing
Industrial Engineering

Selected Publications

  1. Lin, S.W. and K.C. Ying, 2015. Multi-objective unrelated parallel machine scheduling: A Tabu-enhanced iterated Pareto greedy algorithm. Int. J. Prod. Res. 10.1080/00207543.2015.1047981.
    CrossRef  |  

  2. Lin, S.W. and K.C. Ying, 2015. A multi-point simulated annealing heuristic for solving multiple-objective unrelated parallel machine scheduling problem. Int. J. Prod. Res., 53: 1065-1076.
    CrossRef  |  

  3. Ying, K.C., S.W. Lin and S.Y. Wan, 2014. Bi-objective reentrant hybrid flowshop scheduling: An iterated Pareto greedy algorithm. Int. J. Prod. Res., 52: 5735-5747.
    CrossRef  |  

  4. Ying, K.C., 2014. Scheduling the two-machine flowshop to hedge against processing time uncertainty. J. Operational Res. Soc. 10.1057/jors.2014.100.
    CrossRef  |  

  5. Ying, K.C. and S.W. Lin, 2014. Efficient wafer sorting scheduling using a hybrid artificial immune system. J. Operational Res. Soc., 65: 169-179.
    Direct Link  |  

  6. Lu, C.C., S.W. Lin and K.C. Ying, 2014. Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times. Applied Soft Comput., 23: 144-151.
    CrossRef  |  

  7. Lu, C.C., K.C. Ying and S.W. Lin, 2014. Robust single machine scheduling for minimizing total flow time in the presence of uncertain processing times. Comput. Ind. Eng., 74: 102-110.
    CrossRef  |  

  8. Lin, S.W., K.C. Ying and S.Y. Wan, 2014. Minimizing the total service time of discrete dynamic berth allocation problem by an iterated greedy heuristic. Sci. World J., Vol. 2014. 10.1155/2014/218925.
    CrossRef  |  

  9. Lin, S.W. and K.C. Ying, 2014. Minimizing shifts for personnel task scheduling problems: A three-phase algorithm. Eur. J. Operational Res., 237: 323-334.
    CrossRef  |  

  10. Lin, S.W. and K.C. Ying, 2014. ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times. Comput. Operations Res., 51: 172-181.
    CrossRef  |  

  11. Ying, K.C. and S.W. Lin, 2013. A high performing constructive heuristic for minimizing makespan in permutation flowshops. J. Ind. Prod. Eng., 30: 355-362.
    CrossRef  |  

  12. Lin, S.W., K.C. Ying and C.Y. Huang, 2013. Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning. Comput. Operations Res., 40: 1186-1195.
    CrossRef  |  

  13. Lin, S.W., K.C. Ying and C.Y. Huang, 2013. Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm. Int. J. Prod. Res., 51: 5029-5038.
    CrossRef  |  

  14. Lin, S.W. and K.C. Ying, 2013. Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm. OMEGA-Int. J. Manage. Sci., 41: 383-389.
    CrossRef  |  

  15. Lin, S.W. and K.C. Ying, 2013. Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm. Comput. Operations Res., 40: 1625-1647.
    CrossRef  |  

  16. Lin, S.W. and K.C. Ying, 2013. Increasing the total net revenue for single machine order acceptance and scheduling problems using an artificial bee colony algorithm. J. Operational Res. Soc., 64: 293-311.
    Direct Link  |  

  17. Ying, K.C., Z.J. Lee, C.C. Lu and S.W. Lin, 2012. Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence dependent family setups. Int. J. Adv. Manuf. Technol., 58: 671-682.
    CrossRef  |  

  18. Ying, K.C., Z.J. Lee and S.W. Lin, 2012. Makespan minimization for scheduling unrelated parallel machines with setup times. J. Intell. Manuf., 23: 1795-1803.
    CrossRef  |  

  19. Ying, K.C., 2012. Scheduling identical wafer sorting parallel machines with sequence-dependent setup times using an iterated greedy heuristic. Int. J. Prod. Res., 50: 2710-2719.
    CrossRef  |  

  20. Ying, K.C., 2012. Minimizing makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm. Eur. J. Ind. Eng., 6: 199-215.
    Direct Link  |  

  21. Ying, K.C. and S.W. Lin, 2012. Unrelated parallel machines scheduling with sequence- and machine-dependent setup times and due date constraints. Int. J. Innov. Comput. Inform. Control, 8: 3279-3297.
    Direct Link  |  

  22. Lu, C.C., S.W. Lin and K.C. Ying, 2012. Robust scheduling on a single machine to minimize total flow time. Comput. Operations Res., 39: 1682-1691.
    CrossRef  |  

  23. Lin, S.W., K.C. Ying, C.Y. Lee and Z.J. Lee, 2012. An intelligent algorithm with feature selection and decision rules applied to anomaly intrusion detection. Appl. Soft Comput., 12: 3285-3290.
    CrossRef  |  Direct Link  |  

  24. Lin, S.W., C.Y. Huang, C.C. Lu and K.C. Ying, 2012. Minimizing total flow time in permutation flowshop environment. Int. J. Innov. Comput. Inform. Control, 8: 6599-6612.
    Direct Link  |  

  25. Lin, S.W. and K.C. Ying, 2012. Scheduling a bi-criteria flowshop manufacturing cell with sequence-dependent family setup times. Eur. J. Ind. Eng., 6: 474-496.
    Direct Link  |  

  26. Huang, C.Y., H.H. Huang and K.C. Ying, 2012. Sn-Cu-Ni soldering process optimization using multivariate Analysis. IEEE Trans. Components Packaging Manuf. Technol., 2: 527-535.
    CrossRef  |  

  27. Ying, K.C., S.W. Lin, Z.J. Lee and I.L. Lee, 2011. A novel function approximation based on robust fuzzy regression algorithm model and particle swarm optimization. Applied Soft Comput., 11: 1820-1826.
    CrossRef  |  

  28. Ying, K.C., S.W. Lin and C.C. Lu, 2011. Cell formation using a simulated annealing algorithm with variable neighbourhood. Eur. J. Ind. Eng., 5: 22-42.
    Direct Link  |  

  29. Ying, K.C. and S.W. Lin, 2011. Service science: The trend and the future core. J. Chin. Inst. Ind. Eng., 28: 1-2.
    CrossRef  |  

  30. Lin, S.W., Z.J. Lee, K.C. Ying and R.H. Lin, 2011. Meta-heuristic algorithms for wafer sorting scheduling problems. J. Operational Res. Soc., 62: 165-174.
    CrossRef  |  

  31. Lin, S.W., Z.J. Lee, K.C. Ying and C.C. Lu, 2011. Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates. Comput. Operations Res., 38: 809-815.
    CrossRef  |  

  32. Lin, S.W., K.C. Ying, C.C. Lu and J.N.D. Gupta, 2011. Applying multi-start simulated annealing to schedule a flowline manufacturing cell with sequence dependent family setup times. Int. J. Prod. Econ., 130: 246-254.
    CrossRef  |  

  33. Lin, S.W., C.C. Lu and K.C. Ying, 2011. Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints. Int. J. Adv. Manuf. Technol., 53: 353-361.
    Direct Link  |  

  34. Huang, C.Y., Y.H. Lin, K.C. Ying and C.L. Ku, 2011. The solder paste printing process: Critical parameters, defect scenarios, specifications and cost reduction. Soldering Surface Mount Technol., 23: 211-223.
    Direct Link  |  

  35. Cheng, H.M. and K.C. Ying, 2011. Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times. Expert Syst. Applic., 38: 15517-15522.
    CrossRef  |  

  36. Ying, K.C., S.W. Lin, Z.J. Lee and Y.T. Lin, 2010. An ensemble approach applied to classify spam E-mails. Expert Syst. Applic., 37: 2197-2201.
    CrossRef  |  

  37. Ying, K.C., J.N.D. Gupta, S.W. Lin and Z.J. Lee, 2010. Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups. Int. J. Prod. Res., 48: 2169-2184.
    CrossRef  |  

  38. Ying, K.C. and H.M. Cheng, 2010. Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic. Expert Syst. Applic., 37: 2848-2852.
    CrossRef  |  

  39. Lin, S.W., K.C. Ying and Z.J. Lee, 2010. Part-machine cell formation in group technology using a simulated annealing-based meta-heuristic. Int. J. Prod. Res., 48: 3579-3591.
    CrossRef  |  

  40. Lee, Z.J., S.W. Lin and K.C. Ying, 2010. Scheduling jobs on dynamic parallel machines with sequence-dependent setup times. Int. J. Adv. Manuf. Technol., 47: 773-781.
    Direct Link  |  

  41. Lee, Z.J., K.C. Ying, S.C. Chen and S.W. Lin, 2010. Applying PSO-based BPN to predict the yield rate of DRAM modules produced by defective ICs. Int. J. Adv. Manuf. Technol., 49: 987-999.
    CrossRef  |  

  42. Lee, C.Y., Z.J. Lee, S.W. Lin and K.C. Ying, 2010. An Enhanced Ant Colony Optimization (EACO) applied to capacitated vehicle routing problem. Applied Intell., 32: 88-95.
    CrossRef  |  Direct Link  |  

  43. Ying, K.C., S.W. Lin and Z.J. Lee, 2009. Hybrid-directional planning: Improving improvement heuristics for scheduling resource-constrained projects. Int. J. Adv. Manuf. Technol., 41: 358-366.
    CrossRef  |  

  44. Ying, K.C., S.W. Lin and C.Y. Huang, 2009. Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Expert Syst. Applic., 36: 7087-7092.
    CrossRef  |  

  45. Ying, K.C., 2009. An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks. J. Operational Res. Soc., 60: 810-817.
    CrossRef  |  

  46. Ying, K.C. and S.W. Lin, 2009. Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic. Int. J. Prod. Res., 47: 3525-3538.
    CrossRef  |  

  47. Ying, K.C. and S.W. Lin, 2009. Raising the hit rate for wafer fabrication by a simple constructive heuristic. Expert Syst. Applic., 36: 2894-2900.
    CrossRef  |  

  48. Lin, S.W., Z.J. Lee, K.C. Ying and C.Y. Lee, 2009. Applying hybrid meta-heuristics for capacitated vehicle routing problems. Expert Syst. Applic., 36: 1505-1512.
    CrossRef  |  

  49. Lin, S.W., K.C. Ying and Z.J. Lee, 2009. Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times. Comput. Operations Res., 36: 1110-1121.
    CrossRef  |  

  50. Lin, S.W., J.N.D. Gupta, K.C. Ying and Z.J. Lee, 2009. Using simulated annealing to scheduling a flowshop manufacturing cell with sequence dependent family setup times. Int. J. Prod. Res., 47: 3205-3217.
    CrossRef  |  

  51. Lin, S.W. and K.C. Ying, 2009. Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems. Int. J. Prod. Res., 47: 1411-1424.
    CrossRef  |  

  52. Cheng, H.M. and K.C. Ying, 2009. The causality of hourly price-volume relationship: An empirical study of mini Taiwan exchange futures. Expert Syst. Applic., 36: 4896-4899.
    CrossRef  |  

  53. Cheng, H.M. and K.C. Ying, 2009. Testing the significance of solar term effect in the Taiwan stock market. Expert Syst. Applic., 36: 6140-6144.
    CrossRef  |  

  54. Ying, K.C., 2008. Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic. Int. J. Adv. Manuf. Technol., 38: 348-354.
    CrossRef  |  

  55. Ying, K.C., 2008. Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm. Comput. Ind. Eng., 55: 494-502.
    CrossRef  |  

  56. Lin, S.W., K.C. Ying and S.C. Chen, 2008. Particle swarm optimization for parameter determination and feature selection of support vector machines. Expert Syst. Applic., 35: 1817-1824.
    CrossRef  |  

  57. Lin, S.W. and K.C. Ying, 2008. A hybrid approach for single-machine tardiness problems with sequence-dependent setup times. J. Operational Res. Soc., 59: 1109-1119.
    Direct Link  |  

  58. Lee, Z.J., C.P. Lin, K.C. Ying and S.W. Lin, 2008. An intelligent system based on analytic hierarchy process and fuzzy logic applied to evaluate the software quality of Smartphone. Far East J. Exp. Theor. Artificial Intell., 1: 71-86.

  59. Ying, K.C. and S.W. Lin, 2007. Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems. Int. J. Adv. Manuf. Technol., 33: 793-802.
    CrossRef  |  

  60. Lin, S.W., S.Y. Chou and K.C. Ying, 2007. A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date. Eur. J. Operational Res., 177: 1294-1301.
    CrossRef  |  

  61. Lin, S.W. and K.C. Ying, 2007. Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. Int. J. Adv. Manuf. Technol., 34: 1183-1190.
    CrossRef  |  Direct Link  |  

  62. Lee, Z.J., C.C. Chuang and K.C. Ying, 2007. An intelligent algorithm for scheduling jobs on a single machine with a common due date. Lecture Notes Comput. Sci., 4693: 689-695.

  63. Ying, K.C. and S.W. Lin, 2006. Multiprocessor task scheduling in multistage hybrid flow-shops: An ant colony system approach. Int. J. Prod. Res., 44: 3161-3177.

  64. Ying, K.C. and C.J. Liao, 2004. An ant colony system for permutation flow-shop sequencing. Comput. Operations Res., 31: 791-801.
    CrossRef  |  

  65. Ying, K.C. and C.J. Liao, 2003. An ant colony system approach for scheduling problem. Prod. Plann. Control, 14: 68-75.
    CrossRef  |  
Member since December, 2015