期刊論文| 1. | Misaki, S.、Ishibuchi, H.、Tanaka, H.(1995)。Modified simulated annealing algorithms for the flow shop sequencing problem。European Journal of Operational Research，81，388-398。   |
| 2. | Grabowski, J.、Pempera, J.(2001)。New block properties for the permutation flow shop problem with application in tabu search。Journal of the Operational Research Society，52，210-220。 |
| 3. | Lian, Z. G.、Gu, X. S.、Jiao, B.(2008)。A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan。Chaos, Solitons and Fractals，35，851-861。 |
| 4. | Liao, C.-J.、Tseng, C.-T.、Luarn, P.(2007)。A discrete version of particle swarm optimization for flowshop scheduling problems。Computers & Operations Research，34(10)，3099-3111。 |
| 5. | Lin, S.-W.、Ying, K.-C.(2011)。Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm。Computers & Operations Research，40，1625-1647。 |
| 6. | Onwubolu, G.、Davendra, D.(2006)。Scheduling flow shops using differential evolution algorithm。European Journal of Operational Research，171(2)，674-692。 |
| 7. | Osman, I.、Potts, C.(1989)。Simulated annealing for permutation flow shop scheduling。OMEGA，17(6)，551-557。 |
| 8. | Pan, Q.-K.、Tasgetiren, M. F.、Liang, Y.-C.(2008)。A Discrete differential evolution algorithm for the permutation flowshop scheduling problem。Computers & Industrial Engineering，55(4)，795-816。 |
| 9. | Reeves, C. R.(1995)。A genetic algorithm for flowshop sequencing。Computers & Operations Research，22(1)，5-13。 |
| 10. | Ruiz, R.、Stützle, T.(2007)。A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem。European Journal of Operational Research，177(3)，2033-2049。 |
| 11. | Zhang, C.、Jiaxu, N.、Dantong, O.(2010)。A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem。Computers and Industrial Engineering，58(1)，1-11。 |
| 12. | Zobolas, G. I.、Tarantilis, C. D.、Ioannou, G.(2009)。Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm。Computers & Operations Research，36(4)，1249-1267。 |
| 13. | Liu, Y.-F.、Liu, S.-Y.(2013)。A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem。Applied Soft Computing，13(3)，1459-1463。 |
| 14. | Nawaz, Muhammad、Enscore, E. Emory Jr.、Ham, Inyong(1983)。A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem。OMEGA: The International Journal of Management Science，11(1)，91-95。 |
| 15. | Chen, M.-H.、Chang, P.-C.、Lin, C.-H.(2014)。A self-evolving artificial immune system II with T-cell and B-cell for permutation flow-shop problem。Journal of Intelligent Manufacturing，25(6)，1257-1270。 |
| 16. | Kalczynski, P. J.、Kamburowski, J.(2008)。An improved NEH heuristic to minimize makespan in permutation flow shops。Computers and Operations Research，35，3001-3008。 |
| 17. | Garey, M. R.、Johnson, D. S.、Sethi, R.(1976)。The complexity of flowshop and jobshop scheduling。Mathematics of Operations Research，1(2)，117-129。 |
| 18. | Ying, Kuo-ching、Lin, Shih-wei(20130900)。A High-Performing Constructive Heuristic for Minimizing Makespan in Permutation Flowshops。工業工程學刊，30(6)，355-362。 |
| 19. | Tasgetirena, M. F.、Pan, Q.-K.、Suganthan, P. N.、Buyukdagli, O.(2013)。A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem。Computers & Operations Research，40，1729-1743。 |
| 20. | Taillard, E.(1993)。Benchmarks for basic scheduling problems。European Journal of Operational Research，64(2)，278-285。 |
| 21. | Vallada, E.、Ruiz, R.(2010)。Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem。OMEGA International Journal of Management Science，38，57-67。 |
| 22. | Engin, O.、Döyen, A.(2004)。A new approach to solve hybrid flow shop scheduling problems by artificial immune system。Future Generation Computer Systems，20，1083-1095。 |
| 23. | Rajendran, C.、Ziegler, H.(1997)。Heuristics for scheduling in a flowshop with setup, processing and removal times separated。Production Planning and Control，8，568-576。 |
| 24. | Framinan, J. M.、Leisten, R.、Ruiz-Usano, R.(2002)。Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation。European Journal of Operational Research，141，559-569。 |
| 25. | Framinan, J. M.、Leisten, R.(2006)。A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness。International Journal of Production Economics，99，28-40。 |
| 26. | Laha, D.、Sarin, S. C.(2009)。A heuristic to minimize total flow time in permutation flow shop。Omega，37，734-739。 |
| 27. | Ribas, I.、Companys, R.、Tort-Martorell, X.(2010)。Comparing three-step heuristics for the permutation flow shop problem。Computers & Operations Research，37，2062-2070。 |
| 28. | Laha, D.、Chakravorty, A.(2011)。A new heuristic for minimizing total completion time objective in permutation flow shop scheduling。The International Journal of Advanced Manufacturing Technology，53，1189-1197。 |
| 29. | Arroyo, J. E.、De Souza Pereira, A.(2011)。A GRASP heuristic for the multi-objective permutation flowshop scheduling problem。The International Journal of Advanced Manufacturing Technology，55，741-753。 |
| 30. | Modrak, V.(2012)。Alternative constructive heuristic algorithm for permutation flow-shop scheduling problem with make-span criterion。International Journal of Industrial Engineering: Theory, Applications and Practice，19，289-296。 |
| 31. | Ravetti, M. G.、Riveros, C.、Mendes, A.(2012)。Parallel hybrid heuristics for the permutation flow shop problem。Annals of Operations Research，199，269-284。 |
| 32. | Gao, K.、Pan, Q.、Suganthan, P.、Li, J.(2013)。Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization。The International Journal of Advanced Manufacturing Technology，66，1563-1572。 |
| 33. | Fernandez-Viagas, V.、Framinan, J. M.(2014)。On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem。Computers & Operations Research，45，60-67。 |
| 34. | Watson, J.-P.、Barbulescu, L.、Whitley, L. D.(2002)。Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance。INFORMS Journal on Computing，14，98-123。 |
| 35. | Ekşioğlu, B.、Ekşioğlu, S. D.、Jain, P.(2008)。A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods。Computers & Industrial Engineering，54，1-11。 |
| 36. | Gao, J.、Chen, R.、Deng, W.(2013)。An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem。International Journal of Production Research，51，641-651。 |
| 37. | Etiler, O.、Toklu, B.、Atak, M.(2004)。A genetic algorithm for flow shop scheduling problems。Journal of the Operational Research Society，55，830-835。 |
| 38. | Nagano, M. S.、Ruiz, R.、Lorena, L. A. N.(2008)。A constructive genetic algorithm for permutation flowshop scheduling。Computers & Industrial Engineering，55，195-207。 |
| 39. | Tseng, L.-Y.、Lin, Y.-T.(2009)。A hybrid genetic local search algorithm for the permutation flowshop scheduling problem。European Journal of Operational Research，198，84-92。 |
| 40. | Mokotoff, E.(2011)。Algorithms for bicriteria minimization in the permutation flow shop scheduling problem。Journal of Industrial and Management Optimization，7，253-282。 |
| 41. | Chen, S.-H.、Chang, P.-C.、Cheng, T.、Zhang, Q.(2012)。A self-guided genetic algorithm for permutation flowshop scheduling problems。Computers & Operations Research，39，1450-1457。 |
| 42. | Chang, P.-C.、Huang, W.-H.、Wu, J.-L.(2013)。A block mining and re-combination enhanced genetic algorithm for the permutation flowshop scheduling problem。International Journal of Production Economics，141，45-55。 |
| 43. | Mirabi, M.(2014)。A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem。The International Journal of Advanced Manufacturing Technology，71，429-437。 |
| 44. | Varadharajan, T.、Rajendran, C.(2005)。A multi-objective simulatedannealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs。European Journal of Operational Research，167，772-795。 |
| 45. | Loukil, T.、Teghem, J.、Tuyttens, D.(2005)。Solving multi-objective production scheduling problems using metaheuristics。European Journal of Operational Research，161，42-61。 |
| 46. | Suresh, R.、Mohanasundaram, K.(2006)。Pareto archived simulated annealing for job shop scheduling with multiple objectives。The International Journal of Advanced Manufacturing Technology，29，184-196。 |
| 47. | Tasgetiren, M. F.、Liang, Y.-C.、Sevkli, M.、Gencyilmaz, G.(2007)。A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem。European Journal of Operational Research，177(3)，1930-1947。 |
| 48. | Jarboui, B.、Ibrahim, S.、Siarry, P.(2008)。A combinatorial particle swarm optimisation for solving permutation flowshop problems。Computers & Industrial Engineering，54，526-538。 |
| 49. | Sha, D.、Lin, H. H.(2009)。A particle swarm optimization for multi-objective flowshop scheduling。The International Journal of Advanced Manufacturing Technology，45，749-758。 |
| 50. | Liu, H.、Gao, L.、Pan, Q.(2011)。A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem。Expert Systems with Applications，38，4348-4360。 |
| 51. | Marinakis, Y.、Marinaki, M.(2013)。Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem。Soft Computing，17，1159-1173。 |
| 52. | Ramanan, T. R.、Iqbal, M.、Umarali, K.(2014)。A particle swarm optimization approach for permutation flow shop scheduling problem。International Journal for Simulation and Multidisciplinary Design Optimization，5，20。 |
| 53. | Fernandez-Viagas, V.、Framinan, J. M.(2015)。A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem。International Journal of Production Research，53，1111-1123。 |
| 54. | Agarwal, R.、Tiwari, M.、Mukherjee, S.(2007)。Artificial immune system based approach for solving resource constraint project scheduling problem。International Journal of Advanced Manufacturing Technology，34，584-593。 |
| 55. | Tan, K. C.、Goh, C. K.、Mamun, A. A.(2008)。An evolutionary artificial immune system for multi-objective optimization。European Journal of Operational Research，187，371-392。 |
| 56. | Chung, T.-P.、Liao, C.-J.(2013)。An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem。Applied Soft Computing，13(8)，3729-3736。 |
| 57. | Nowicki, E.、Smutnicki, C.(1996)。A fast tabu search algorithm for the permutation flow-shop problem。European Journal of Operational Research，91，160-175。 |