| Reference: | 英文文獻：
1. Allahverdi, A. and Tatari, M. F., 1996, “Simulation of different rules in stochastic flowshops,” Computers and Industrial Engineering, Vol. 31(1/2), 209-212.
2. Baker, C.T. and Dzielinski, B.P.,1960. Simulation of a simplified job shop. Management Science,6:311-323
3. Baker, K. R., and Kanet, J. J., 1983, “Job shop scheduling with modified due dates,” Journal of Operations Management, Vol. 4(1), 11-22.
4. Baker, K.R.,1974,Introduction to Sequencing and Scheduling. Wiley, New York.
5. Barrett R. and Kadipasaoglu,S.N.,1999. “Evaluation of Dispatching Rules in a Dynamic Flow Shop”,Producion and Inventory Management Journal,31:1,54-58
6. Blackstone, J.H., Phillips, D.T., and Hogg, G.L.,1982. A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int. J. Prod. Res.,20:27-45
7. Chang, F. C. R., 1996, ”A study of due-date assignment rules with constrained tightness in a dynamic job shop,” Computer and Industrial Engineering, Vol. 31(1/2), 205-208.
8. Conway, R.W., 1965. Priority dispatching and job lateness in a job shop. J. Ind. Eng., 16:228-237
9. Day J.E., Hottenstein, M.P., 1970. Review of sequencing research. Naval Research Logistics Quarterly 17,11-39
10. Graham, R.L., et al., 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling : a Survey”, Ann. Discrete Math, 5, 287-326
11. Haupt, R., 1989. A survey of priority rule-based scheduling. OR Spektrum,11:3-16
12. Holthaus,O.,1997.”Design of Efficient Job Shop Scheduling Rules”, Computer &industrial Engeneering Vol 33 Nos 1-2.247-252
13. Holthaus,O.,1999.”Scheduling in job shops with machine breakdowns:an experimental study”,Computer &industrial Engeneering Vol 36,137-162
14. Holthaus,O.,Rajendran,C ,2000. “A study on the performance of scheduling rules in buffer-constrained dynamic-flowshops” International Journal of Production Research, vol. 40, no. 13, 3041-3052
15. Holthaus,O.,Rajendran,C ,2000. Efficient jobshop dispatching rules:further developments. Production Planning & Control Vol11 NO.2, 171-178
16. Holthaus,O.,Rajendran,C 1997. Efficient dispatching rules for scheduling in a job shop. International journal of production economics 48,87-105
17. Holthaus,O.,Rajendran,C 1999. A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research 116,156-170
18. Hunsucker, J. L. and Shah, J. R., 1994, “Comparative performance analysis ofpriority rules in a constrained flow shop with multiple processors environment,” European Journal of Operational Research, Vol. 72, 102-114.
19. Liu, K. C., 1998, “Dispatching rules for stochastic finite capacity scheduling,”Computers and Industrial Engineering, Vol. 35(1), 113-116.
20. Nanot, Y.R., 1963. An experimental investigation and comparative evaluation of priority disciplines in job-shop=like queueing networks. Management Sciences Research Project, UCLA,Research roport No.87
21. Narasimhan, S. L., Mangiameli, P. M., 1987, “A comparison of sequencing rules for a two-stage hybrid flow shop,” Decision Sciences, Vol. 18, 250-265.
22. Raghu and Rajendran,1993. An Efficient Dynamic Dispatching Rule for Scheduling in a Job Shop. Int. J. Prod. Econom.,32,301-313
23. Raghu, T.S., Rajendran, C., 1993. An efficient dynamic dispatching rule for scheduling in a job shop. International Journal of Production Economic 32,301-313
24. Russell, R.S., Dar-el, E.M., Taylor ΙΙΙ, B.W.,1987. A comparative analysis of the COVERT job sequencing rule using various shop performance measures. International Journal of Production Research 25,215-238
25. Sarper, H. and Henry, M., 1996, “Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop,” Omega, Vol. 24(1), 73-81.
26. Waikar, A. M., Sarker, B. R. and Lal, A. M., 1995, “A comparative study of some priority dispatching rules under different shop loads,” Production Planning & Control, Vol. 6(4), 301-310.
27. Wilbrecht, J.K. and Presscott, W.R., 1969. The influence of setup time on job shop performance. Management Science,16:274-280
中文文獻：
28. 陳建良，1995，「排程概述」，機械工業雜誌第12 月號，pp.122-137。
29. 王治平，2003，實際零工式生產排程問題的派工法則，國立政治大學資訊管理研究所，碩士論文。 |
