一、中文文獻
1. 官長輝(2003)。「基因演算法於國道客運最適車輛數及排程之整合研究」,輔仁大學管理學研究所。二、英文文獻
1. Allahverdi, A. (1999). “Stochastically minimizing total flowtime in flowshops with no waiting space”, European Journal of Operational Research. 113, pp. 101-112.
2. Cheng, T. C. E. & Wang, G. (1999). “Two-machine flowshop scheduling with consecutive availability constraints”, Information Processing Letters. 71, pp.49-54.
3. Cepek, O., Okada, M. & Vlach, M. (2002). “Nonpreemptive flowshop scheduling with machine dominance”, European Journal of Operational Research. 139, pp. 245-261.
4. David, L. (1996). “Application of a hybrid genetic algorithms to airline crew scheduling”, Computers Ops Res. Vol. 23, No. 6, pp. 547-558.
5. French, S., B. A., M. A. & Phil, D. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Ellis Horwood Ltd.
6. Gupta, J. N. D., Neppalli, V. R. & Werner, F. (2001). “Minimizing total flow time in a two-machine flowshop problem with minimum makespan”, International Journal of Production economics. 69, pp. 323-338.
7. Holland J. (1975). “Adaptation in Natural and Artificial Systems”, University of Michigan Press: Michigan.
8. Ho, J. C. & Gupta, J. N. D. (1995). “Flowshop scheduling with dominant machines”, Computers Ops Res. Vol. 22, No. 2, pp. 237-246.
9. Huang, R. H. & Yang, C. L. (2005) “Genetic algorithm for scheduling maintenance of a mass rapid transit train system”, International Journal of Industrial Engineering, 12, pp.227-233.
10. Johnson, S. M. (1954) “Optimal two and three-stage production schedules with set-up times include”, Nav. Res. Logist. Q., 1, pp. 61-68.
11. Koulamas, C. (1998). “On the complexity of two-machine flowshop problems with due date related objectives”, European Journal of Operational Research. 106, pp.95-100.
12. Koksalan, M., Azizoglu, M. & Kondakci, S. K. (1998). “Minimizing flowtime and maximum earliness on a single machine”, IIE Transactions. 30, pp.192-200.
13. Liaw, C. F. (2000). “A hybrid genetic algorithm for the open shop scheduling problem”, European Journal of Operational Research, 124, pp.28-42.
14. Lin, B. M. T. (2001). “Scheduling in the two-machine flowshop with due date constraints”, International Journal of Production Economics. 70, pp. 117-123.
15.Murata, T., Ishibuchi, H. & Tanaka, H. (1996). “Genetic algorithms for flowshop scheduling problems”, Computers ind. Engng, Vol. 30, No. 4, pp. 1061-1071.
16. Park, B. J., Choi, H. R. & Kim, H. S. (2003). “A hybrid genetic algorithm for the job shop scheduling problems”, Computers & Industrial Engineering, 45, pp. 597-613.
17. Rodolfo, D. L., Jose, L. B. A. (2005). “Design and control strategies of PV-Diesel systems using genetic algorithms”, Solar Energy, 79, pp. 33-46.
18. Smith M. L., Panwalkar S. S. & Dudek R. A.(1975) “Flowshop sequencing problem with ordered processing time matrices”, Management Science, 21, pp. 544-549.
20. Toktas, B., Azizoglu, M. & Koksalan, S. K. (2004). “Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan”, European Journal of Operational Research. 157, pp. 286-295.
21. Yang, D. L. & Chern, M. S. (1995). “A two-machine flowshop sequencing problem with limited waiting time constraints”, Computers ind. Engng. Vol. 28, No. 1, pp. 63-70.
22. Ying, K. C. & Liao, C. J. (2004). “An ant colony system for permutation flow-shop sequencing”, Computers & Operations Research. 31, pp.791-801.