參考文獻
[1]Graham, T., Lawer, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., “Optimization and approximation in eterministic sequence and scheduling a survey”, Annals of Discrete Mathematics, Vol.5, pp.287-326 (1979).
[2]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)
[3]Koksalan, M., Azizoglu, M., Kondakci, Koksalan, S., “Minimizing flowtime and maximum earliness on a single machine”, Institute of Industrial Engineerings, Vol.30, No.2, pp.192-200 (1998)
[4]Zaloom, V., Vatz, D., “A note on the optimal scheduling of two parallel processors”, Naval Research Logistics Quarterly, Vol.22, No.4, pp.823-827 (1975)
[5]Webster, S., “Weighted flow time bounds for scheduling identical processors”, European Journal of Operational Research, Vol.80, No.1, pp.103-111 (1995)
[6]Azizoglu, M., 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)
[7]Salem, A., Anagnostopoulos, G.C., Rabadi, G., “A branch-and-bound algorithm for parallel machine scheduling problems”
[8]Johnson, S. M., “Optimal two- and three-stage production schedules with setup times included”, Naval Research Logistics Quarterly, Vol.1, No.1, pp.61–68 (1954)
[9]Garey, M.R., Johnson, D.S., Sethi, R., “ The complexity of flowshop and jobshop scheduling”, Mathematics of Operations Research, Vol.1, No.2, pp.117-129 (1976)
[10]Croce, F.D., Narayan, V., Tadeia, R., “The two-machine total completion time flow shop problem”, European Journal of Operational Research, Vol.90, No.2, pp.227-237 (1996)
[11]Ravindran, D., Selvakumar, S.J., Sivaraman, R., Noorul Haq, A., “Flow shop scheduling with multiple objective of minimizing makespan and total flow time”, The International Journal of Advanced Manufacturing Technology, Vol.25, No.9-10, pp.1007-1012 (2005)
[12]Deman, V., John, M., Baker, K.R., “Minimizing mean flowtime in the flow shop with no intermediate queues”, AIIE Transactions, Vol.6, No.1, pp.28-34 (1974)
[13]Rajendran, C., Chaudhuri, D, “Heuristic algorithms for Continuous Flow-Shop Problem” Naval Research Logistics, Vol.37, No.5, pp.695-705 (1990).
[14]T’Kindt, V., Gupta, J.N.D., Billaut, J.C., ”A Branch-and-Bound algorithm to Solve a Two-Machine Bicriteria Flowshop Scheduling Problem”,ORP3, PARIS, 26-29 September (2001)
[15]Adams, J., Balas, E., Zawack, D., “The shifting bottleneck procedure for job shop scheduling”, Management Science, Vol.34, No.3, pp.391-401 (1988)
[16]Applegate, D., Cook, W., “A computational study of the job shop scheduling problem,” ORSA Journal on Computing, Vol. 3, No.2, pp.149-156 (1991)
[17]Mckoy, D.H.C., 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)
[18]Sun, D., Batta, R., “Scheduling large job shop: A decomposition approach”, International Journal of Production Research, Vol.34, No.7, pp.2019-2033 (1996)
[19]Brucker, P., Jurisch, B., Sievers, B., “A branch and bound algorithm for the job-shop scheduling problem”, Discrete Applied Mathematics, Vol.49, No.1-3, pp.107-127 (1994)
[20]Achugbue, J.O., Chin, F.Y., “Scheduling the open shop to minimize mean flow time”, Society for Industrial and Applied Mathematics, Vol.11, No.4, pp.709-720 (1982)
[21]Brucker, P., Johann, H., Bernd, J., Birgit, W., “A Branch & Bound Algorithm for the Open Shop Problem”, Discrete Applied Mathematics, Vol.76, No.1-3, pp. 43-59 (1997)
[22]Gueret, C., Prins, C., “Classical and new heuristics for the open-shop problem: A computational evaluation”, European Journal of Operational Research, Vol.107, No.2, pp.306-314 (1998)
[23]Gonzalez, T., Sahni, S., “Open shop scheduling to minimize finish time”, Journal of the Assooauon for Computing Machinery, Vol.23, No.4, pp.665-679 (1976)
[24]Liaw, C. F., “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)
[25]Liaw, C. F., Cheng C. Y., Chen, M., “The total completion time open shop scheduling problem with a given sequence of jobs on one machine”, Computers & Operations Research, Vol. 29, pp. 1251-1266 (2002)
[26]Tang, L., Bai, D., “A new heuristic for open shop total completion time problem”, Applied Mathematical Modelling, Vol.34, No.3, pp 735-743 (2010)
[27]Du, J., Leung, J.Y.T., ”Minimize mean flow time in twomachine open-shops and flow-shops”, Journal of Algorithms, Vol.14, No.1, pp.24-44 (1990)
[28]Liu, C. Y., Bulfin, R. L., “On the complexity of preemptive open-shop scheduling problems”, Operations Research Letter, Vol.4, No.2, pp.71-74 (1985)
[29]Cho, Y., Sahni, S., “Preemptive scheduling of independent jobs with release and due time on open, flow and job shop”, Operations Research, Vol.29, No.3, pp.511-522 (1981)
[30]Brasel, H., Hennes, H., “On the open-shop problem with preemption and miniminzing the average completion time”, European Journal of Operational Research, Vol.157, No.3, pp.607-619 (2004).
[31]Liu, C. Y., Bulfin, R. L., “Scheduling ordered open shops”, Computers & Operations Research, Vol. 14, No. 3, pp.257-264 (1987)
[32]Liu, C. Y., “A branch and bound algorithm for the preemptive open shop scheduling problem”, Journal of the Chinese Institute of Industrial Engineers, Vol. 12, No. 1, pp.25-31 (1995)
[33]Liaw, C. F., “Scheduling two-machine preemptive open shops to minimize total completion time”, Computers & Operations Research, Vol.31, No.8, pp.1349-1363 (2004)
[34]陳怡聲,「允許中斷之開放工廠總完工時間最小化問題之研究」,碩士論文,私立朝陽科技大學工業工程與管理研究所,台中(2002)[35]曾佳盈,「以分枝界限法求解可中斷式開放工廠排程問題」,碩士論文,私立朝陽科技大學工業工程與管理研究所,台中(2011)