期刊論文| 1. | Brucker, P.、Hurink, J.、Jurisch, B.、Wöstmann, B.(1997)。A branch & bound algorithm for the open-shop problem。Discrete Applied Mathematics，76，43-59。   |
| 2. | Gonzalez, T.、Sahni, S.(1976)。Open shop scheduling to minimize finish time。Journal of the Association for Computing Machinery，23(4)，665-679。 |
| 3. | Lawler, E. L.、Lenstra, J. K.、Rinnooy Kan, A. H. G.(1981)。Minimizing maximum lateness in a two-machine open shop。Mathematics of Operations Research，6(1)，153-158。 |
| 4. | Yoshida, T.、Hitomi, K.(1979)。Optimal two-stage production scheduling with setup times separated。AIIE Transactions，11，261-263。 |
| 5. | 吳雪馥(1998)。開放式排程之遲延交貨與提早完工庫存總成本最小啟發解法。工業工程學刊，15(2)，159-167。 延伸查詢 |
| 6. | 廖經芳(2000)。A Hybrid Genetic Algorithm for The Open Shop Scheduling Problem。European Journal of Operational Research，124(1)，28-42。 |
| 7. | 廖經芳、林安祥(2001)。開放工廠總加權延遲最小化排程問題之研究。工業工程學刊，18(6)，29-42。 延伸查詢 |
| 8. | Achugbue, J. O.、Chin, Francis Y. L.(1982)。Scheduling the open shop to minimize mean flow time。SIAM Journal on Computing，11(4)，709-720。 |
| 9. | Du, Jianzhong、Leung, Joseph Y. T.(1993)。Minimizing mean flow time in two-machine open shops and flow shops。Journal of Algorithms，14(1)，24-44。 |
| 10. | Kyparisis, G. J.、Koulamas, C.(2000)。Open Shop Scheduling with Makespan and Total Completion Time Criteria。Computers & Operations Research，27(1)，15-27。 |
| 11. | 廖經芳(1999)。Applying simulated annealing to the open shop scheduling problem。IIE Transactions，31(5)，457-465。 |
| 12. | 廖經芳(1998)。An iterative improvement approach for the nonpreemptive open shop scheduling problem。European Journal of Operational Research，111(3)，509-517。 |
| 13. | 廖經芳(1999)。A Tabu Search Algorithm for the Open Shop Scheduling Problem。Computers & Operations Research，26(2)，109-126。 |
| 14. | 吳雪馥、劉常勇、劉賓陽(1995)。A heuristics approach to the total tardiness in nonpreemptive open shop scheduling。International Journal of Industrial Engineering，2(1)，25-33。 |
| 15. | Low, Chin-Yao、Wu, Tai-Hsi(2001)。Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment。International Journal of Production Research，39(4)，689-708。 |
| 16. | Proust, C.、Gupta, J. N. D.、Deschamps, V.(1991)。Flowshop scheduling with set-up, processing and removal times separated。International Journal of Production Research，29，479-493。 |
| 17. | Strusevich, V. A.(1993)。Two Machine Open Shop Scheduling Problem with Setup, Processing and Removal Times Separated。Computers & Operations Research，20(6)，597-611。 |
| 18. | Sule, D. R.(1982)。Sequencing n jobs on two machines with setup, processing and removal times separated。Naval Research Logistics Quarterly，29，517-519。 |
| 19. | Sule, D. R.、Huang, K. Y.(1983)。Sequency on two and three machines with setup, processing and removal times separated。International Journal of Production Research，21，723-732。 |