Dr. Chin-Chia  Wu
My Social Links

Dr. Chin-Chia Wu

Professor
Feng-Chia University, Taiwan


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

Share this Profile

Biography

Chin-Chia Wu is a Professor in the Department of Statistics, Feng Chia University,Taiwan. He has received a Doctoral degree from the Graduate Institute of Management, School of Management, National Taiwan University of Science and Technology, Taiwan in 1997. His teaching and research interests include Applied Statistics and Operations Research. He is advisory board member in American journal of Management Studies, Guest Editor at Mathematical Problems in Engineering, and Discrete Dynamics in Nature and Society, Editor for ISRN Industrial Engineering, The Scientific World Journal, member of editorial board of Advances in Industrial Engineering and Management. He has published 117 research articles in journals contributed as author/co-author.

Area of Interest:

Mathematics
100%
Statistics
62%
Operations Research
90%
Applied Statistics
75%
Computation
55%

Research Publications in Numbers

Books
0
Chapters
0
Articles
0
Abstracts
0

Selected Publications

  1. Yin, Y., W.H. Wu, T.C.E. Cheng, C.C. Wu and W.H. Wu, 2015. A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times. Applied Math. Modell., 39: 2587-2601.
    CrossRef  |  Direct Link  |  
  2. Yin, Y., W.H. Wu, T.C.E. Cheng and C.C. Wu, 2015. Single-machine scheduling with time-dependent and position-dependent deteriorating jobs. Int. J. Comput. Integr. Manuf., 28: 781-790.
    CrossRef  |  Direct Link  |  
  3. Yin, Y., T.C.E. Cheng, X. Yang and C.C. Wu, 2015. Two-agent single-machine scheduling with unrestricted due date assignment. Comput. Ind. Eng., 79: 148-155.
    CrossRef  |  Direct Link  |  
  4. Yin, Y., T.C.E. Cheng, L. Wan, C.C. Wu and J. Liu, 2015. Two-agent single-machine scheduling with deteriorating jobs. Comput. Ind. Eng., 81: 177-185.
    CrossRef  |  Direct Link  |  
  5. Yin, Y., S.R. Cheng, J.Y. Chiang, J.C. Chen, X. Mao and C.C. Wu, 2015. Scheduling problems with due date assignment. Discrete Dyn. Nat. Soc. 10.1155/2015/683269.
    CrossRef  |  Direct Link  |  
  6. Wu, W.H., W.H. Wu, J.C. Chen, W.C. Lin, J. Wu and C.C. Wu, 2015. A heuristic-based genetic algorithm for the two-machine flowshop scheduling with learning consideration. J. Manuf. Syst., 35: 223-233.
    CrossRef  |  Direct Link  |  
  7. Wu, C.C., Y. Yin, W.H. Wu, H.M. Chen and S.R. Cheng, 2015. Using a branch-and-bound and a genetic algorithm for a single-machine total late work scheduling problem. Soft Comput., (In Press). 10.1007/s00500-015-1590-z.
    CrossRef  |  Direct Link  |  
  8. Liu, S.C., W.L. Hung and C.C. Wu, 2015. Note on a single-machine scheduling problem with sum of processing times based learning and ready times. Math. Probl. Eng. .
    Direct Link  |  
  9. Zhuang, Y., W. Liu, C.C. Wu and J. Li, 2014. Pawlak algebra and approximate structure on fuzzy lattice. Scient. World J. 10.1155/2014/697107.
    CrossRef  |  Direct Link  |  
  10. Zhao, C.L., Y. Yin, T.C.E. Cheng and C.C. Wu, 2014. Single-machine scheduling and due date assignment with rejection and position-dependent processing times. J. Ind. Manage. Optimiz., 10: 691-700.
    CrossRef  |  Direct Link  |  
  11. Zhao, C., C.J. Hsu, S.R. Cheng, Y. Yin and C.C. Wu, 2014. Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs. Applied Math. Comput., 248: 503-510.
    CrossRef  |  Direct Link  |  
  12. Yin, Y., W.H. Wu, W.H. Wu and C.C. Wu, 2014. A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects. Inform. Sci., 256: 91-108.
    CrossRef  |  Direct Link  |  
  13. Yin, Y., W.H. Wu, T.C.E. Cheng and C.C. Wu, 2014. Due-date assignment and single-machine scheduling with generalised position-dependent deteriorating jobs and deteriorating multi-maintenance activities. Int. J. Prod. Res., 52: 2311-2326.
    CrossRef  |  Direct Link  |  
  14. Yin, Y., T.E. Cheng, C.C. Wu and S.R. Cheng, 2014. Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time. J. Operat. Res. Soc., 65: 1-13.
    CrossRef  |  Direct Link  |  
  15. Yin, Y., T.C.E. Cheng, C.C. Wu and S.R. Cheng, 2014. Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity. Int. J. Prod. Res., 52: 5583-5596.
    CrossRef  |  Direct Link  |  
  16. Yin, Y., T.C.E. Cheng and C.C. Wu, 2014. Scheduling with time-dependent processing times. Math. Probl. Eng. 10.1155/2014/201421.
    CrossRef  |  Direct Link  |  
  17. Yin, Y., S.R. Cheng and C.C. Wu, 2014. Parallel-machine scheduling to minimize flowtime, holding and batch delivery costs. Asia-Pac. J. Operat. Res., Vol. 31, No. 6. 10.1142/S0217595914500444.
    CrossRef  |  Direct Link  |  
  18. Xu, J., Y. Yin, T.C.E. Cheng, C.C. Wu and S. Gu, 2014. An improved memetic algorithm based on a dynamic neighbourhood for the permutation flowshop scheduling problem. Int. J. Prod. Res., 52: 1188-1199.
    CrossRef  |  Direct Link  |  
  19. Xu, J., Y. Yin, T.C.E. Cheng, C.C. Wu and S. Gu, 2014. A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan. Applied Soft Comput., 24: 277-283.
    CrossRef  |  Direct Link  |  
  20. Wu, W.H., Y. Yin, W.H. Wu, C.C. Wu and P.H. Hsu, 2014. A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents. J. Ind. Manage. Optimiz., 10: 591-611.
    CrossRef  |  Direct Link  |  
  21. Wu, W.H., Y. Yin, S.R. Cheng, P.H. Hsu and C.C. Wu, 2014. Genetic algorithm for a two-agent scheduling problem with truncated learning consideration. Asia-Pac. J. Operat. Res., Vol. 31, No. 6. 10.1142/S0217595914500468.
    CrossRef  |  Direct Link  |  
  22. Wu, C.C., W.H. Wu, W.H. Wu, P.H. Hsu, Y. Yin and J. Xu, 2014. A single-machine scheduling with a truncated linear deterioration and ready times. Inform. Sci., 256: 109-125.
    CrossRef  |  Direct Link  |  
  23. Wang, C.H., J.Y. Kung, K.I. Lee, W.C. Lin, C.C. Wu and N.S. Wang, 2014. A note on minimizing the total loss for two quality characteristics with one-sided specification limit. Adv. Ind. Eng. Manage., 3: 1-4.
    CrossRef  |  Direct Link  |  
  24. Lai, K., P.H. Hsu, P.H. Ting and C.C. Wu, 2014. A truncated sum of processing-times-based learning model for a two-machine flowshop scheduling problem. Hum. Factors Ergon. Manuf. Serv. Ind., 24: 152-160.
    CrossRef  |  Direct Link  |  
  25. Fan, M., P. Zou, S.R. Li and C.C. Wu, 2014. A fast approach to bimatrix games with intuitionistic fuzzy payoffs. Scient. World J. 10.1155/2014/121245.
    CrossRef  |  Direct Link  |  
  26. Yin, Y., T.C.E. Cheng, S.R. Cheng and C.C. Wu, 2013. Single-machine batch delivery scheduling with an assignable common due date and controllable processing times. Comput. Ind. Eng., 65: 652-662.
    CrossRef  |  Direct Link  |  
  27. Yin, Y., T.C.E. Cheng, J. Xu, S.R. Cheng and C.C. Wu, 2013. Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration. J. Ind. Manage. Optimiz., 9: 323-339.
    CrossRef  |  Direct Link  |  
  28. Yin, Y., T.C.E. Cheng, J. Wang and C.C. Wu, 2013. Single-machine common due window assignment and scheduling to minimize the total cost. Discrete. Optim., 10: 42-53.
    CrossRef  |  Direct Link  |  
  29. Yin, Y., T.C.E. Cheng, C.J. Hsu and C.C. Wu, 2013. Single-machine batch delivery scheduling with an assignable common due window. Omega, 41: 216-225.
    CrossRef  |  Direct Link  |  
  30. Yin, Y., T.C.E. Cheng, C.C. Wu and S.R. Cheng, 2013. Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times. Int. J. Prod. Res., 51: 5083-5099.
    CrossRef  |  Direct Link  |  
  31. Yin, Y., S.R. Cheng, T.C.E. Cheng, W.H. Wu and C.C. Wu, 2013. Two-agent single-machine scheduling with release times and deadlines. Int. J. Shipping Transp. Logist., 5: 75-94.
    CrossRef  |  Direct Link  |  
  32. Yin, Y., M. Liu, T.C.E. Cheng, C.C. Wu and S.R. Cheng, 2013. Four single-machine scheduling problems involving due date determination decisions. Inform. Sci., 251: 164-181.
    CrossRef  |  Direct Link  |  
  33. Yin, Y., C.C. Wu, W.H. Wu, C.J. Hsu and W.H. Wu, 2013. A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents. Applied Soft Comput., 13: 1042-1054.
    CrossRef  |  Direct Link  |  
  34. Yin, Y., C.C. Wu, W.H. Wu and J.C. Chen, 2013. Single-machine group scheduling with a general learning effect. Eur. J. Ind. Eng., 7: 350-369.
    CrossRef  |  Direct Link  |  
  35. Wu, W.H., J. Xu, W.H. Wu, Y. Yin, I.F. Cheng and C.C. Wu, 2013. A tabu method for a two-agent single-machine scheduling with deterioration jobs. Comput. Operat. Res., 40: 2116-2127.
    CrossRef  |  Direct Link  |  
  36. Wu, C.C., Y. Yin and S.R. Cheng, 2013. Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions. J. Operat. Res. Soc., 64: 147-156.
    CrossRef  |  Direct Link  |  
  37. Wu, C.C., W.H. Wu, J.C. Chen, Y. Yin and W.H. Wu, 2013. A study of the single-machine two-agent scheduling problem with release times. Applied Soft Comput., 13: 998-1006.
    CrossRef  |  Direct Link  |  
  38. Wu, C.C., W.C. Lee and M.J. Liou, 2013. Single-machine scheduling with two competing agents and learning consideration. Inform. Sci., 251: 136-149.
    CrossRef  |  Direct Link  |  
  39. Wu, C.C., S.R. Cheng, W.H. Wu, Y. Yin and W.H. Wu, 2013. The single-machine total tardiness problem with unequal release times and a linear deterioration. Applied Math. Comput., 219: 10401-10415.
    CrossRef  |  Direct Link  |  
  40. Kang, C.C. and C.C. Wu, 2013. Statistical precision of productivity change: A bootstrap application to Taiwan's telecommunications industry. Telecommun. Policy, 37: 1015-1032.
    CrossRef  |  Direct Link  |  
  41. Cheng, T.C.E., C.C. Wu, J.C. Chen, W.H. Wu and S.R. Cheng, 2013. Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. Int. J. Prod. Econ., 141: 79-86.
    CrossRef  |  Direct Link  |  
  42. Yin, Y., W.H. Wu, S.R. Cheng and C.C. Wu, 2012. An investigation on a two-agent single-machine scheduling problem with unequal release dates. Comput. Operat. Res., 39: 3062-3073.
    CrossRef  |  Direct Link  |  
  43. Yin, Y., T.C.E. Cheng, D. Xu and C.C. Wu, 2012. Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding and batch delivery cost. Comput. Ind. Eng., 63: 223-234.
    CrossRef  |  Direct Link  |  
  44. Yin, Y., S.R. Cheng, T.C.E. Cheng, C.C. Wu and W.H. Wu, 2012. Two-agent single-machine scheduling with assignable due dates. Applied Math. Comput., 219: 1674-1685.
    CrossRef  |  Direct Link  |  
  45. Yin, Y., S.R. Cheng and C.C. Wu, 2012. Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties. Inform. Sci., 189: 282-292.
    CrossRef  |  Direct Link  |  
  46. Yin, Y., D. Xu, S.R. Cheng and C.C. Wu, 2012. A generalisation model of learning and deteriorating effects on a single-machine scheduling with past-sequence-dependent setup times. Int. J. Comput. Integr. Manuf., 25: 804-813.
    CrossRef  |  Direct Link  |  
  47. Yin, Y., C.C. Wu, W.H. Wu and S.R. Cheng, 2012. The single-machine total weighted tardiness scheduling problem with position-based learning effects. Comput. Operat. Res., 39: 1109-1116.
    CrossRef  |  Direct Link  |  
  48. Wu, W.H., S.R. Cheng, C.C. Wu and Y. Yin, 2012. Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations. J. Intell. Manuf., 23: 1985-1993.
    CrossRef  |  Direct Link  |  
  49. Wu, C.C., Y. Yin, W.H. Wu and S.R. Cheng, 2012. Some polynomial solvable single-machine scheduling problems with a truncation sum-of-processing-times based learning effect. Eur. J. Ind. Eng., 6: 441-453.
    CrossRef  |  Direct Link  |  
  50. Wu, C.C., W.H. Wu, P.H. Hsu and K. Lai, 2012. A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function. Applied Math. Modell., 36: 5001-5014.
    CrossRef  |  Direct Link  |  
  51. Lai, P.J., C.C. Wu and W.C. Lee, 2012. Single-machine scheduling with logarithm deterioration. Optimiz. Lett., 6: 1719-1730.
    CrossRef  |  Direct Link  |  
  52. Wu, C.C., Y. Yin and S.R. Cheng, 2011. Some single-machine scheduling problems with a truncation learning effect. Comput. Ind. Eng., 60: 790-795.
    CrossRef  |  Direct Link  |  
  53. Wu, C.C., W.C. Lee and Y.R. Shiau, 2011. A single-machine deteriorating job scheduling problem with a non-regular criterion. Asia-Pac. J. Operat. Res., 28: 349-359.
    CrossRef  |  Direct Link  |  
  54. Wu, C.C., S.K. Huang and W.C. Lee, 2011. Two-agent scheduling with learning consideration. Comput. Ind. Eng., 61: 1324-1335.
    CrossRef  |  Direct Link  |  
  55. Wu, C.C., P.H. Hsu, J.C. Chen, N.S. Wang and W.H. Wu, 2011. Branch-and-bound and simulated annealing algorithms for a total weighted completion time scheduling with ready times and learning effect. Int. J. Adv. Manuf. Technol., 55: 341-353.
    CrossRef  |  Direct Link  |  
  56. Wu, C.C., P.H. Hsu, J.C. Chen and N.S. Wang, 2011. Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times. Comput. Operat. Res., 38: 1025-1034.
    CrossRef  |  Direct Link  |  
  57. Wu, C.C., P.H. Hsu and K. Lai, 2011. Simulated-annealing heuristics for the single-machine scheduling problem with learning and unequal job release times. J. Manuf. Syst., 30: 54-62.
    CrossRef  |  Direct Link  |  
  58. Wu, C.C., J.C. Chen, W.H. Wu, P.H. Hsu and W.H. Wu, 2011. Simulated annealing algorithms for the two-machine makespan flowshop scheduling with truncated learning consideration. Int. J. Ind. Eng.: Theory Applic. Pract., 18: 432-443.
    Direct Link  |  
  59. Li, D.C., P.H. Hsu, C.C. Wu and T.E. Cheng, 2011. Two-machine flowshop scheduling with truncated learning to minimize the total completion time. Comput. Ind. Eng., 61: 655-662.
    CrossRef  |  Direct Link  |  
  60. Lee, W.C., S.K. Chen, C.W. Chen and C.C. Wu, 2011. A two-machine flowshop problem with two agents. Comput. Operat. Res., 38: 98-104.
    CrossRef  |  Direct Link  |  
  61. Lee, W.C., P.J. Lai and C.C. Wu, 2011. Some single-machine and flowshop scheduling problems with a non-linear deterioration function. Comput. Math. Applic., 62: 2487-2496.
    CrossRef  |  Direct Link  |  
  62. Gawiejnowicz, S., W.C. Lee, C.L. Lin and C.C. Wu, 2011. Single-machine scheduling of proportionally deteriorating jobs by two agents. J. Operat. Res. Soc., 62: 1983-1991.
    CrossRef  |  Direct Link  |  
  63. Cheng, T.E., W.H. Wu, S.R. Cheng and C.C. Wu, 2011. Two-agent scheduling with position-based deteriorating jobs and learning effects. Applied Math. Comput., 217: 8804-8824.
    CrossRef  |  Direct Link  |  
  64. Cheng, T.E., S.R. Cheng, W.H. Wu, P.H. Hsu and C.C. Wu, 2011. A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. Comput. Ind. Eng., 60: 534-541.
    CrossRef  |  Direct Link  |  
  65. Cheng, T.C.E., W.C. Lee and C.C. Wu, 2011. Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times. Applied Math. Modell., 35: 1861-1867.
    CrossRef  |  Direct Link  |  
  66. Wu, C.C. and C.L. Liu, 2010. Minimizing the makespan on a single machine with learning and unequal release times. Comput. Ind. Eng., 59: 419-424.
    CrossRef  |  Direct Link  |  
  67. Lee, W.C., Y.S. Lin and C.C. Wu, 2010. A branch-and-bound and heuristic algorithm for the single-machine time-dependent scheduling problem. Int. J. Adv. Manuf. Technol., 47: 1217-1223.
    CrossRef  |  Direct Link  |  
  68. Lee, W.C., Y.R. Shiau, S.K. Chen and C.C. Wu, 2010. A two-machine flowshop scheduling problem with deteriorating jobs and blocking. Int. J. Prod. Econ., 124: 188-197.
    CrossRef  |  Direct Link  |  
  69. Lee, W.C., W.J. Wang, Y.R. Shiau and C.C. Wu, 2010. A single-machine scheduling problem with two-agent and deteriorating jobs. Applied Math. Modell., 34: 3098-3107.
    CrossRef  |  Direct Link  |  
  70. Lee, W.C., S.K. Chen and C.C. Wu, 2010. Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem. Expert Syst. Applic., 37: 6594-6601.
    CrossRef  |  Direct Link  |  
  71. Lee, W.C., C.C. Wu and P.H. Hsu, 2010. A single-machine learning effect scheduling problem with release times. Omega, 38: 3-11.
    CrossRef  |  Direct Link  |  
  72. Lee, W.C. and C.C. Wu, 2010. A note on optimal policies for two group scheduling problems with deteriorating setup and processing times. Comput. Ind. Eng., 58: 646-650.
    CrossRef  |  Direct Link  |  
  73. Cheng, T.C.E., W.C. Lee and C.C. Wu, 2010. Single-machine scheduling with deteriorating functions for job processing times. Applied Math. Modell., 34: 4171-4178.
    CrossRef  |  Direct Link  |  
  74. Cheng, T.C.E., W.C. Lee and C.C. Wu, 2010. Scheduling problems with deteriorating jobs and learning effects including proportional setup times. Comput. Ind. Eng., 58: 326-331.
    CrossRef  |  Direct Link  |  
  75. Wu, C.C., Y.R. Shiau, L.H. Lee and W.C. Lee, 2009. Scheduling deteriorating jobs to minimize the makespan on a single machine. Int. J. Adv. Manuf. Technol., 44: 1230-1236.
    CrossRef  |  Direct Link  |  
  76. Wu, C.C. and W.C. Lee, 2009. Single-machine and flowshop scheduling with a general learning effect model. Comput. Ind. Eng., 56: 1553-1558.
    CrossRef  |  Direct Link  |  
  77. Wu, C.C. and W.C. Lee, 2009. A note on the total completion time problem in a permutation flowshop with a learning effect. Eur. J. Operat. Res., 192: 343-347.
    CrossRef  |  Direct Link  |  
  78. Lee, W.C., C.C. Wu, Y.H. Chung and H.C. Liu, 2009. Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates. Comput. Operat. Res., 36: 2111-2121.
    CrossRef  |  Direct Link  |  
  79. Lee, W.C., C.C. Wu and M.F. Liu, 2009. A single-machine bi-criterion learning scheduling problem with release times. Expert Syst. Applic., 36: 10295-10303.
    CrossRef  |  Direct Link  |  
  80. Lee, W.C., C.C. Wu and H.C. Liu, 2009. A note on single-machine makespan problem with general deteriorating function. Int. J. Adv. Manuf. Technol., 40: 1053-1056.
    CrossRef  |  Direct Link  |  
  81. Lee, W.C. and C.C. Wu, 2009. Some single-machine and m-machine flowshop scheduling problems with learning considerations. Inform. Sci., 179: 3885-3892.
    CrossRef  |  Direct Link  |  
  82. Lee, W.C. and C.C. Wu, 2009. A note on single-machine group scheduling problems with position-based learning effect. Applied Math. Modell., 33: 2159-2163.
    CrossRef  |  Direct Link  |  
  83. He, C.C., C.C. Wu and W.C. Lee, 2009. Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs. J. Operat. Res. Soc., 60: 1759-1766.
    CrossRef  |  Direct Link  |  
  84. Chung, Y.H., H.C. Liu, C.C. Wu and W.C. Lee, 2009. A deteriorating jobs problem with quadratic function of job lateness. Comput. Ind. Eng., 57: 1182-1186.
    CrossRef  |  Direct Link  |  
  85. Cheng, T.E., P.J. Lai, C.C. Wu and W.C. Lee, 2009. Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations. Inform. Sci., 179: 3127-3135.
    CrossRef  |  Direct Link  |  
  86. Wu, C.C., Y.R. Shiau and W.C. Lee, 2008. Single-machine group scheduling problems with deterioration consideration. Comput. Operat. Res., 35: 1652-1659.
    CrossRef  |  Direct Link  |  
  87. Wu, C.C. and W.C. Lee, 2008. Single-machine scheduling problems with a learning effect. Applied Math. Modell., 32: 1191-1197.
    CrossRef  |  Direct Link  |  
  88. Wu, C.C. and W.C. Lee, 2008. Single-machine group-scheduling problems with deteriorating setup times and job-processing times. Int. J. Prod. Econ., 115: 128-133.
    CrossRef  |  Direct Link  |  
  89. Liu, H.C., W.C. Lee and C.C. Wu, 2008. A note on single-machine group scheduling problem with a general learning function. J. Stat. Manage. Syst., 11: 645-652.
    CrossRef  |  Direct Link  |  
  90. Lee, W.C., C.C. Wu, C.C. Wen and Y.H. Chung, 2008. A two-machine flowshop makespan scheduling problem with deteriorating jobs. Comput. Ind. Eng., 54: 737-749.
    CrossRef  |  Direct Link  |  
  91. Lee, W.C., C.C. Wu and Y.H. Chung, 2008. Scheduling deteriorating jobs on a single machine with release times. Comput. Ind. Eng., 54: 441-452.
    CrossRef  |  Direct Link  |  
  92. Lee, W.C. and C.C. Wu, 2008. Multi-machine scheduling with deteriorating jobs and scheduled maintenance. Applied Math. Modell., 32: 362-373.
    CrossRef  |  Direct Link  |  
  93. Cheng, T.E., C.C. Wu and W.C. Lee, 2008. Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Inform. Sci., 178: 2476-2487.
    CrossRef  |  Direct Link  |  
  94. Cheng, T.C.E., C.C. Wu and W.C. Lee, 2008. Some scheduling problems with deteriorating jobs and learning effects. Comput. Ind. Eng., 54: 972-982.
    CrossRef  |  Direct Link  |  
  95. Wu, C.C., W.C. Lee and Y.R. Shiau, 2007. Minimizing the total weighted completion time on a single machine under linear deterioration. Int. J. Adv. Manuf. Technol., 33: 1237-1243.
    CrossRef  |  Direct Link  |  
  96. Wu, C.C., W.C. Lee and W.C. Wang, 2007. A two-machine flowshop maximum tardiness scheduling problem with a learning effect. Int. J. Adv. Manuf. Technol., 31: 743-750.
    CrossRef  |  Direct Link  |  
  97. Wu, C.C., W.C. Lee and T. Chen, 2007. Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations. Comput. Ind. Eng., 52: 124-132.
    CrossRef  |  Direct Link  |  
  98. Wu, C.C. and W.C. Lee, 2007. A note on single-machine scheduling with learning effect and an availability constraint. Int. J. Adv. Manuf. Technol., 33: 540-544.
    CrossRef  |  Direct Link  |  
  99. Shiau, Y.R., W.C. Lee, C.C. Wu and C.M. Chang, 2007. Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration. Int. J. Adv. Manuf. Technol., 34: 774-782.
    CrossRef  |  Direct Link  |  
  100. Wu, C.C., 2006. The development of a solution to the single-machine total weighted completion time problem with a learning effect. Int. J. Manage., 23: 113-116.
    Direct Link  |  
  101. Wu, C.C. and W.C. Lee, 2006. Two-machine flowshop scheduling to minimize mean flow time under linear deterioration. Int. J. Prod. Econ., 103: 572-584.
    CrossRef  |  Direct Link  |  
  102. Wu, C.C. and W.C. Lee, 2006. Single machine scheduling to minimize the setup time and the earliness. J. Inform. Optim. Sci., 27: 499-510.
    CrossRef  |  Direct Link  |  
  103. Lee, W.C. C.C. Wu and P. Chen, 2006. A simulated annealing approach to makespan minimization on identical parallel machines. Int. J. Adv. Manuf. Technol., 31: 328-334.
    CrossRef  |  Direct Link  |  
  104. Chen, P. C.C. Wu and W.C. Lee, 2006. A bi-criteria two-machine flowshop scheduling problem with a learning effect. J. Oper. Res. Soc., 57: 1113-1125.
    CrossRef  |  Direct Link  |  
  105. Wu, C.C., 2005. A makespan study of the two-machine flowshop scheduling problem with a learning effect. J. Stat. Manag. Syst., 8: 13-25.
    CrossRef  |  Direct Link  |  
  106. Wu, C.C. and W.C. Lee, 2005. A single-machine group schedule with fuzzy setup and processing times. J. Inform. Opti. Sci., 26: 683-691.
    CrossRef  |  Direct Link  |  
  107. Lee, W.C. and C.C. Wu, 2005. A single-machine bicriterion scheduling problem with setup times. J. Stat. Manag. Syst., 8: 559-568.
    CrossRef  |  Direct Link  |  
  108. Pan, J.C.H. and C.C. Wu, 2004. Stochastic group scheduling problems on single and multiple machines. J. Stat. Manage. Syst., 7: 87-98.
    CrossRef  |  Direct Link  |  
  109. Lee, W.C., C.C. Wu and H.J. Sung, 2004. A bi-criterion single-machine scheduling problem with learning considerations. Acta Inform., 40: 303-315.
    CrossRef  |  Direct Link  |  
  110. Lee, W.C. and C.C. Wu, 2004. Minimizing total completion time in a two-machine flowshop with a learning effect. Int. J. Prod. Econ., 88: 85-93.
    CrossRef  |  Direct Link  |  
  111. Wu, C.C. and W.C. Lee, 2003. Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine. Inform. Process. Lett., 87: 89-93.
    CrossRef  |  Direct Link  |  
  112. Lee, W.C. and C.C. Wu, 2001. Minimizing the total flow time and the tardiness in a two-machine flow shop. Int. J. Syst. Sci., 32: 365-373.
    CrossRef  |  Direct Link  |