期刊論文| 1. | Al-Fawzan, M. A.、Haouari, M.(2005)。A Bi-objective Model for Robust Resource-constrained Project Scheduling。International Journal of Production Economics，96，175-187。   |
| 2. | Ruiz, R.、Maroto, C.(2005)。A comprehensive review and evaluation of permutation flowshop heuristics。European Journal of Operational Research，165，479-494。 |
| 3. | Liaw, C. F.(2003)。An efficient tabu search approach for the two-machine preemptive open shop scheduling problem。Computers and Operations Research，30，2081-2095。 |
| 4. | Sridhar, J.、Rajendran, C.(1993)。Scheduling in a cellular manufacturing system: a simulated annealing approach。International Journal of Production Research，31(12)，2927-2945。 |
| 5. | Haouari, M.、Daouas, T.(1999)。Optimal scheduling of the 3-machine assembly-type flow shop。RAIRO--Operations Research，33，439-445。 |
| 6. | Hariri, A. M. A.、Potts, C. N.(1997)。A branch and bound algorithm for the two-stage assembly scheduling problem。European Journal of Operational Research，103，547-556。 |
| 7. | Potts, C. N.、Sevast'janov, S. V.、Strusevich, V. A.、Van Wassenhove, L. N.、Zwaneveld, C. M.(1995)。The two-stage assembly scheduling problem: Complexity and approximation。Operations Research，43，346-355。 |
| 8. | Sun, X.、Morizawa, K.、Nagasawa, H.(2003)。Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling。European Journal of Operational Research，146，498-516。 |
| 9. | Tozkapan, A.、Kirca, Ö.、Chung, C. S.(2003)。A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem。Computers & Operations Research，30，309-320。 |
| 10. | Lee, C. Y.、Cheng, T. C. E.、Lin, B. M. T.(1993)。Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem。Management Science，39，616-625。 |
| 11. | Pan, C. H.、Chen, J. S.(1997)。Scheduling alternative operations in two-machine flow-shops。Journal of the Operational Research Society，48，533-540。 |
| 12. | Al-Anzi, F. S.、Allahverdi, A.(2001)。The relation between three-tired client-server internet database and two-machine flowshop。International Journal of Parallel and Distributed Systems and Networks，4，94-101。 |
| 13. | Allahverdi, A.、Gupta, J. N. D.、Aldowaisan, T.(1999)。A review of scheduling research involving setup considerations。OMEGA, The International Journal of Management Sciences，27，219-239。 |
| 14. | Allahverdi, A.、Ng, C. T.、Cheng, T. C. E.、Kovalyov, M. Y.(2006)。A survey of scheduling problems with setup times or costs。European Journal of Operational Research。 |
| 15. | Al-Turki, U.、Fedjki, C.、Andijani, A.(2001)。Tabu search for a class of single-machine scheduling problems。Computers & Operations Research，28，1223-1230。 |
| 16. | Allahverdi, A.、Al-Anzi, F. S.(2002)。Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications。Computers & Operations Research，29，971-994。 |
| 17. | Koulamas, C.、Kyparisis, G. J.(2001)。The three-stage assembly flowshop scheduling problem。Computers & Operations Research，28，687-704。 |
| 18. | Low, C. Y.(2005)。Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines。Computers & Operations Research，32，2013-2025。 |
| 19. | Mika, M.、Waligora, G.、Weglarz, J.(2005)。Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models。European Journal of Operational Research，164，639-668。 |
| 20. | Sadegheih, A.(2006)。Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance。Applied Mathematical Modelling，30，147-154。 |
| 21. | Wang, M. Y.、Sethi, S. P.、Van De Velde, S. L.(1997)。Minimizing makespan in a class of reentrant shops。Operations Research，45，702-707。 |