期刊論文| 1. | Widmer, M.、Hertz, A.(1989)。A New Heuristic Method for the Flow Shop Sequencing Problem。European Journal of Operational Research，41，186-193。   |
| 2. | Reza Hejazi, S.、Saghafian, S.(2005)。Flowshop-scheduling problems with makespan criterion: a review。International Journal of Production Research，43(14)，2895-2929。 |
| 3. | Palmer, D. S.(1965)。Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time: A Quick Method of Obtaining a Near Optimum。Journal of the Operational Research Society，16(1)，101-107。 |
| 4. | Gupta, J. N. D.、Stafford, E. F. Jr.(2006)。Flowshop Scheduling Research after Five Decades。European Journal of Operational Research，169(3)，699-711。 |
| 5. | Ruiz, R.、Maroto, C.(2005)。A comprehensive review and evaluation of permutation flowshop heuristics。European Journal of Operational Research，165，479-494。 |
| 6. | 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。 |
| 7. | Bonney, M.、Gundry, S.(1976)。Solutions to the constrained flowshop sequencing problem。Operational Research Quarterly，27，869-883。 |
| 8. | Carlier, J.、Rebaï, I.(1996)。Two branch and bound algorithms for the permutation flowshop problem。European Journal of Operational Research，90，238-251。 |
| 9. | Dong, X.、Huang, H.、Chen, P.(2008)。An improved NEHbased heuristic for the permutation flowshop problem。Computers and Operations Research，35，3962-3968。 |
| 10. | Framinan, J. M.、Gupta, J. N. D.、Leisten, R.(2004)。A review and classification of heuristics for permutation flow-shop scheduling with makespan objective。Journal of the Operational Research Society，55，1243-1255。 |
| 11. | Framinan, J. M.、Leisten, R.、Rajendran, C.(2003)。Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem。International Journal of Production Research，41，121-148。 |
| 12. | Gupta, J. N.(1971)。A functional heuristic algorithm for the flowshop scheduling problem。Operational Research Quarterly，22，39-47。 |
| 13. | Hundal, T. S.、Rajgopal, J.(1988)。An extension of Palmer's heuristic for the flow shop scheduling problem。International Journal of Production Research，26，1119-1124。 |
| 14. | Kalczynski, P. J.、Kamburowski, J.(2007)。On the NEH heuristic for minimizing the makespan in permutation flowshops。Omega，35，53-60。 |
| 15. | Kalczynski, P. J.、Kamburowski, J.(2008)。An improved NEH heuristic to minimize makespan in permutation flow shops。Computers and Operations Research，35，3001-3008。 |
| 16. | Kouki, S.、Jemni, M.、Ladhari, T.(2011)。Solving the permutation flow shop problem with makespan criterion using grids。International Journal of Grid and Distributed Computing，4，53-64。 |
| 17. | Koulamas, C.(1998)。A new constructive heuristic for the flowshop scheduling problem。European Journal of Operational Research，105，66-71。 |
| 18. | Lin, S. W.、Ying, K. C.(2009)。Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems。International Journal of Production Research，47，1411-1424。 |
| 19. | Potts, C. N.(1980)。An adaptive branching rule for the permutation flowshop problem。European Journal of Operational Research，5，19-25。 |
| 20. | Pour, H. D.(2001)。A new heuristic for the n-job, m-machine flow-shop problem。Production Planning and Control，12，648-653。 |
| 21. | Ying, K. C.(2009)。An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks。Journal of the Operational Research Society，60，810-817。 |
| 22. | Ying, K. C.、Gupta, J. N. D.、Lin, S. W.、Lee, Z. J.(2010)。Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups。International Journal of Production Research，48，2169-2184。 |
| 23. | Campbell, H. G.、Dudek, R. A.、Smith, M. L.(1970)。A Heuristic Algorithm for the n Job, m Machine Sequencing Problem。Management Science，16(10)，630-667。 |
| 24. | Garey, M. R.、Johnson, D. S.、Sethi, R.(1976)。The complexity of flowshop and jobshop scheduling。Mathematics of Operations Research，1(2)，117-129。 |
| 25. | Johnson, S. M.(1954)。Optimal two and three stage production schedules with setup times included。Naval Research Logistics Quarterly，1(1)，61-68。 |
| 26. | Page, E. S.(1961)。An approach to the scheduling of jobs on machines。Journal of the Royal Statistical Society, B Series，23，484-492。 |
| 27. | Ying, K. C.、Liao, C. J.(2004)。An ant colony system for permutation flow-shop sequencing。Computers & Operations Research，31(5)，791-801。 |
| 28. | Taillard, E.(1993)。Benchmarks for basic scheduling problems。European Journal of Operational Research，64(2)，278-285。 |
| 29. | Taillard, E. D.(1990)。Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem。European Journal of Operational Research，47，65-74。 |
| 30. | Graham, R. L.、Lawler, E. L.、Lenstra, J. K.、Rinnooy Kan, A. H. G.(1979)。Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey。Annals of Discrete Mathematics，5，287-326。 |