1. Elmaghraby, S.E., and Park, S.H., “Scheduling jobs on a number of identical machines”, AIIE Transactions, Vol.6, pp.1-13 (1974).
2. Deman, V., John, M., and Baker, K.R., “Minimizing mean flow time in the flow shop with no intermediate queues”, AIIE Transactions, Vol.6, No.1, pp.28-34 (1974).
3. Emmons, H., “One machine sequencing to minimize mean flow time with minimum number tardy”, Naval Research Logistics Quarterly , Vol.22, No.3, pp.585-592 (1975).
4. Zaloom, V., and Vatz, D., “Note on optimal scheduling of two parallel processors”, Naval Research Logistics Quarterly, Vol.22, No.4, pp.823-827 (1975).
5. Garey, M.R., Johnson, D.S., and Sethi, R., “Complexity of flow shop and job shop scheduling”, Mathematics of Operations Research, Vol.1, No.2,pp.117-129 (1976).
6. Gonzalez, T., and Sahni, S., “Open shop scheduling to minimize finish time”, JACM, Vol.23, No.4, pp.665-679 (1976).
7. Barnes, J.W., and Brennan, J.J., “An improved algorithm for scheduling jobs on identical machines”, AIIE Transactions, Vol.9, pp.25-31 (1977).
8. Sethi, R., “On the complexity of mean flow time scheduling”, Mathematics of Operations Research, Vol.2, No.4, pp.320-330 (1977).
9.Gonzalez,T., “A note on open shop preemptive schedules”, IEEE Transactions on Computer, Vol.28, pp.782-786 (1979).
10.Graham, T., Lawer, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G., “ Optimization and approximation in deterministic sequence and scheduling a survey”, Annals of Discrete Mathematics, Vol.5, pp.287-326(1979).
11.Cho,Y.,and S.,Sahni, “Preemptive scheduling of independent jobs with release and due time on open, flow,and job shop”, Operations Research, Vol.29, pp.511-522 (1981).
12.Lawler,E.L., J.K., Lenstra, and A.H.G., Rinnooy Kan “ Minimizing maximum lateness in a two-machine open shop”, Mathematics of Operation Research, Vol.6, pp.138-153 (1981).
13.Achugbue, J.O., and Chin F.Y., “Scheduling the open shop to minimize mean flow time”, SIAM J. COMPUT., Vol.11, pp.709-720 (1982).
14.Szwarc, W., “Flow shop problem with mean completion time criterion”, IIE Transactions (Institute of Industrial Engineering), Vol.15, No.2, pp.172-176 (1983).
15. Liaw, C., “Multi-machine scheduling problems”, Master thesis, Dept. of Industrial Management, National Cheng-Kung Univ., Taiwan (1987).
16.Brucker,P.,Jurisch,B.,and Jurisch,M., “Open shop problem with unit time operatons”, ZOR, Vol.37, pp.59-73 (1987).
17.Sarin, S.C., Ahn, S., and Bishop, A.B., “An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flow time”, International Journal of Production Research, Vol.26, pp.1183-1191 (1988).
18.Aksjonov.V.A. , “A polynomial-time algorithm of approximate solution of a scheduling problem”, Upravlyaemye Sistemy, Vol.28, pp.273-281 (1989).
19.Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B.,“Sequencing and Scheduling: Algorithms and Complexity”, ReportBS-R8909, Center for Mathematics and Computer Science, P.O. Box 4079, 1009 AB Amsterdam, The Netherlands (1989).
20.Ho, J.C., and Chang, Y.L., “New heuristic for n-job, m-machine flow shop problem”, European Journal of Operational Research, Vol.52,No.2, pp.194-202 (1991).
21.Rajendran, C., “Heuristic algorithm for scheduling in a flow shop to minimize total flow time”, International Journal of Production Economics, Vol.29, No.1, pp.65-73 (1993).
22.Liu,C.Y., “A branch and bound algorithm for the preemptive Open shop problem ”, Journal of the Chinese Institute of Industrial Engineers, Vol.12,No.1, pp.25-31 (1995).
23.Webster, S., “Weighted flow time for scheduling identical processors”, European Journal of Operational Research, Vol.80, No.1, pp.103-111(1995).
24.Croce, F.D., Narayan, V., and Tadei, R., “Two-machine total completion time flow shop problem”, European Journal of Operational Research, Vol.90, No.2, pp.227-237 (1996).
25.Sun, D., and Batta, R., “Scheduling large job shop: A decomposition approach”, International Journal of Production Research, Vol.34, No.7,pp.2019-2033 (1996).
26.Ramudhin,A.,and Maruer,P., “The generalized shifting bottleneck procedure”, Europen Journal of Operational Research, Vol.93, pp.34-48 (1996).
27.Werra, D.de, Hoffman,A.J., Mahadev,N.V.R., Peled,U.N., “Restrictions and preassignments in preemptive open shop scheduling”, DISCRETE APPLIED MATHEMATICS, Vol.68, No.2, pp.169-188 (1996).
28.Gladky,A.A., “A two-machine preemptive open shop scheduling problem:An elementary proof of NP-completeness”, European Journal of Operational Research, Vol.103, No.3, pp.113-116 (1997).
29.Holthans, O., and Rajendran, C., “Efficient dispatching rules for
scheduling in a job shop”, International Journal of Production Economics , Vol.48, No.1, pp.87-105 (1997)
30.Rajendran, C., and Ziegler, H., “Efficient heuristic for scheduling in a flow shop to minimize total weight flow time of jobs”, European Journal of Operational Research, Vol.103, No.1, pp.129-138 (1997).
31.Liaw, C., “An iterative improvement approach for the non-preemptive open shop scheduling problem”, European Journal of Operational Research, Vol.111, No.3, pp.509-517 (1998).
32.Liu,C,Y., and Bulfin,R.L., “Scheduling ordered open shop”, Computers & Operations Research, Vol.14,No.3, pp.257-264 (1998).
33.Koksalan, M., Azizoglu, M., Kondakci, and Koksalan, S., “Minimizing flow time and maximum earliness on a single machine”, IIE Transactions (Institute of Industrial Engineerings), Vol.30, No.2,pp.192-200 (1998).
34.Mckoy, D.H.C., and Egbelu, P.J., “Minimizing production flow time in a process and assembly job shop”, International Journal of Production Research, Vol.36, No.8, pp.2315-2332 (1998).
35.Sergey V. Sevastianov, Gerhard J.Woeginger , “Makespan minimization in open shops:A polynomial time approximation scheme”, Mathematical Programming, Vol.82, pp.191-198 (1998).
36.Woo, H.S., and Yeh, D.S., “Heuristic algorithm for mean flow time objective in flow shop scheduling”, Computers & Operations Research, Vol.25, No.3, pp.175-182 (1998).
37.Azizoglu, M., and Kirca, O., “On the minimization of total weighted flow time with identical and uniform parallel machines”, European Journal of Operational Research, Vol.113, pp.91-100 (1999).
38.Liaw, C., “A Tabu search algorithm for the open shop scheduling problem”, European Journal of Operational Research, Vol.26, No.2, pp.109-126 (1999).
39.George J. Kyparisis, Christos, Koulamas, “Open shop scheduling with makespan and total completion time criteria”, Comprters and operations research, Vol.27, No.2, pp.15-27 (2000).
40.Liaw, C.,Cheng,C.,Chen,M., “The total completion time open shop scheduling problem with a given sequence of jobs on one machine”, Comprters and operations research, Vol.22, pp.1251-1266 (2002).
41.Holger Hennes ,Heidemarie Brasel,, “On the open-shop problem with preemption and minimizing the average completion time”,European Journal Of Operational Research, Vol.157, pp.607-619 (2004).
42.Liaw,C., “Scheduling two-machine preemptive open shops to minimize total completion time”,Computer and Operation Research, Vol.31, pp.1349-1363 (2004).
43.Liaw, C., “Scheduling preemptive open shop to minimize total tardiness ” ,European Journal Of Operational Research, Vol.16, pp.173-183 (2005).
44.Cheng,T.C.E,Ng. C.T.,Yuan,J.J.,Liu,Z.H., “Single machine scheduling to minimize total weighted tardiness”,European Journal Of Operational Research, Vol.165, pp.423-443 (2005).
45.陳哲宇,「應用塔布搜尋法求解兩部機器可分割工作開放工廠總延遲時間最小化之排程問題」,碩士論文,朝陽科技大學工業工程與管理研究所,台中(2002).