期刊論文| 1. | Armentano, Vinicius A.、Scrich, Cintia Rigão(2000)。Tabu search for minimizing total tardiness in a job shop。International Journal of Production Economics，63，131-140。   |
| 2. | Widmer, M.、Hertz, A.(1989)。A New Heuristic Method for the Flow Shop Sequencing Problem。European Journal of Operational Research，41，186-193。 |
| 3. | Kimt, Y. D.(1993)。A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshop。Computers and Operations Research，20，391-401。 |
| 4. | Nawaz, M.、Enscore, E. E.、Ham, I.(1983)。A heuristic algorithm for the m-machine, n-job flow-shop sequencing。Omega，11，91-95。 |
| 5. | 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。 |
| 6. | Gonzalez, T.、Sahni, S.(1976)。Open shop scheduling to minimize finish time。Journal of the Association for Computing Machinery，23(4)，665-679。 |
| 7. | Sen, T.、Dileepan, P.、Gupta, J. N. D.(1993)。The two machine flowshop with total tardiness。Computers & Operations Research，20，391-401。 |
| 8. | Holthaus, O.、Rajendran, C.(1997)。Efficient dispatching rules for scheduling in a job shop。International Journal of Production Economics，48(1)，87-105。 |
| 9. | Baker, K. R.、Kanet, J. J.(1983)。Job Shop Scheduling with Modified Due-Dates。Journal of Operations Management，4(1)，11-22。 |
| 10. | Baker, K. R.(1984)。Sequencing Rules and Due date Assignments in A Job Shop。Management Science，30(9)，1093-1104。 |
| 11. | Giffer, B.、Thompson, G. L.(1960)。Algorithms for Solving Production-scheduling Problems。Operations Research，8(4)，487-503。 |
| 12. | Anderson, E. J.、Nyirenda, J. C.(1990)。Two new rules to minimize tardiness in a job shop。International Journal of Production Research，28(12)，2277-2292。 |
| 13. | Arementano, V. A.、Ronconi, D. P.(1999)。Tabu search for total tardiness minimization in flowshop scheduling problems。Computers & Operations Research，26(3)，219-235。 |
| 14. | Gupta, J. N. D.、Croce, D. F.、Tadei, R.(2000)。Minimizing tardy jobs in a flowshop with common due date。European Journal of Operational Research，120，375-381。 |
| 15. | Bayeon, E. S.、Wu, S. D.、Robert, H. S.(1998)。Decomposition heuristics for robust job shop scheduling。IEEE Transactions on Robotics and Automation，14(2)，303-313。 |
| 16. | Gelder, L. F.、Sambandam, N.(1978)。Four simple heuristics for scheduling a flow-shop。International Journal of Production Research，16，221-231。 |
| 17. | Hariri, A. M. A.、Gupta, J. N. D.(1997)。Two-Machine Flowshop Scheduling to Minimize the Number of Tardy Jobs。Journal of the Operational Research Society，48(2)，212-220。 |
| 18. | Hariri, A. M. A.、Potts, C. N.(1989)。A branch and bound algorithm to minimize number of tardy jobs。European Journal of Operational Research，38，228-237。 |
| 19. | Hayya, J. C.、Kanet, J. J.(1982)。Priority dispatching with operation due date。Journal of Operations Management，2，167-175。 |
| 20. | Kim, Y.(1993)。Heuristics for flowshop scheduling problems minimizing tardiness。Journal of the Operational Research Society，44，19-28。 |
| 21. | Kim, Y.(1995)。Minimizing mean tardiness on flowshop。European Journal of Operational Research，85，541-555。 |
| 22. | Kyparisis, G. J.、Christosa, K.(1997)。Open shop scheduling with maximal machines。Discrete Applied Mathematics，78，175-187。 |
| 23. | 吳雪馥(1998)。開放式排程之遲延交貨與提早完工庫存總成本最小啟發解法。工業工程學刊，15(2)，159-167。 延伸查詢 |
| 24. | 吳雪馥(1995)。開放式排程遲延成本之啟發解。中山管理評論，3(4)，122-143。 延伸查詢 |
| 25. | Bayiz, M.、Sabuncuoglu, I.(1999)。Job shop scheduling with beam search。European Journal of Operational Research，118，390-412。 |
| 26. | Singer, M.、Michael, P.(1998)。A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops。IIE Transactions，30，109-118。 |
| 27. | Townsend, W.(1977)。Sequencing n jobs on m machine to minimize maximum tardiness。Management Science，23，1016-1019。 |
| 28. | Vepsalainen, A. P. J.、Morton, T. E.、Vepsalainen, A.、Morton, T.(1987)。Priority rules for job shops with weighted tardiness costs。Management Science，33，1035-1047。 |
| 29. | 廖經芳(2000)。A Hybrid Genetic Algorithm for The Open Shop Scheduling Problem。European Journal of Operational Research，124(1)，28-42。 |
| 30. | 廖經芳(1998)。An iterative improvement approach for the nonpreemptive open shop scheduling problem。European Journal of Operational Research，111(3)，509-517。 |
| 31. | 廖經芳(1999)。A Tabu Search Algorithm for the Open Shop Scheduling Problem。Computers & Operations Research，26(2)，109-126。 |
| 32. | 吳雪馥、劉常勇、劉賓陽(1995)。A heuristics approach to the total tardiness in nonpreemptive open shop scheduling。International Journal of Industrial Engineering，2(1)，25-33。 |