| Reference: | 1.陳建良，1995，“排程概述”，機械工業雜誌，12月，頁122-137。
2.麥昭仁，1996，“晶圓製造廠主要機種派工法則之設計“，國立交通大學工業工程研究所，碩士論文。
3.Appold, S. J., Harrison, B., and Kelley, M. R., 1993, “Spatially proximate inter-organizational networks, agglomeration economics, and technological performance in U.S. manufacturing,” Annual meeting of the association of American geographers.
4.Allahverdi, A. and Tatari, M. F., 1996, “Simulation of different rules in stochastic flowshops,” Computers and Industrial Engineering, 31(1/2), pp. 209-212
5.Baker, C. T. and Dzielinski, B. P., 1960, “Simulation of a simplified job shop,” Management Science, Vol. 6, pp. 311-323.
6.Baker, K. R., and Kanet, J. J., 1983, “Job shop scheduling with modified due dates,” Journal of Operations Management, 4(1), pp. 11-22.
7.Baker, K. R., 1984, “Sequencing rules and due-date assignments in a job shop,” Management Science, 30(9), pp. 1093-1104.
8.Ballakur, A., and Steudel, H. J., 1984, “Integration of job shop control systems: a state-of-the-art review,” Journal of Manufacturing Systems, Vol. 3, pp. 71-79.
9.Barrett R. and Kadipasaoglu, S. N. 1999, "Evaluation of Dispatching Rules in a Dynamic Flow Shop", Production and Inventory Management Journal, 31:1, pp.: 54-58..
10.Blackstone, J.H., Philips, D.T. and Hogg, G.L., 1982, “A state-of-the-art survey of dispatching rules for manufacturing job shop operations,” International Journal of Production Research, Vol. 20, pp. 27-45.
11.Chang, Yih-long, Sueyoshi, T., and Sullivan, R. S., 1996, “Ranking dispatching rules by data envelopment analysis in a job shop environment,” IIE Transactions, Vol. 28, pp. 631-642.
12.Conway, R. W., 1965, “Priority dispatching and work-in-process inventory in a job shop,” Journal of Industrial Engineering, Vol. 16, pp.123-130 and pp. 228-237.
13.Conway, R. W., et al., 1967, "Theory of Scheduling", Addison-Wesley.
14.Dar-El, E. M., and R. A. Wysk. 1982. “Job Shop Scheduling - A Systematic Approach,” Journal of Manufacturing Systems, Vol. 1, pp. 77-88.
15.Elvers, D. A., 1974, “The sensitivity of relative effectiveness of jobshop dispatching rules with respect to various arrival distributions,” IIE Transactions, 6(1), pp. 41-49.
16.Graham, R.L., et al., 1979, "Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey", Ann. Discrete Math, 5, pp.287-326.
17.Haupt, R., 1989. “A survey of priority rule-based scheduling,” OR Spektrum, Vol.11, pp. 3-16.
18.Herrmann, J. W., 2001, "Improving Manufacturing System Performance through Rescheduling", Computer Integrated Manufacturing Laboratory, University of Maryland, June 21
19.Hershaner, J. C., and Ebert, J., 1975, “Search and simulation selection of a job-shop scheduling rule,” Management Science, Vol. 21, pp. 53-63.
20.Hertz, A. and Widmer, M., 1996, "An improved tabu search approach for solving the job shop scheduling problem with tooling constraints," Discrete Applied Mathematics, 65, pp.319-345.
21.Holthaus, O., Rajendran, C., 1997. “Efficient dispatching rules for scheduling in a job shop,” International Journal of Production Economics, Vol. 48, pp.87-105.
22.Jain, A. S. and Meeran S., 1998, "A State-of-the-Art Review of Job-Shop Scheduling Techniques", Technical Report, Department of Applied Physics, Electronic and Mechanical Engineering University of Dundee, Dundee, Scotland, UK.
23.Hunsucker, J. L. and Shah, J. R., 1994, “Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment,” European Journal of Operational Research, 72, pp. 102-114
24.Liu, K. C., 1998, “Dispatching rules for stochastic finite capacity scheduling,” Computers and Industrial Engineering, 35(1), pp. 113-116.
25.Montazeri, M., and Van Wassenhove, L. N., 1986, “Scheduling rules for manufacturing systems,” Working paper 86-01, Afdeling Industrial Beleid, K. U. Leuvan, Leuyen, Belgium.
26.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 report No.87.
27.Narasimhan, S. L., Mangiameli, P. M., 1987, “A comparison of sequencing rules for a two-stage hybrid flow shop,” Decision Sciences, Vol. 18, pp. 250-265.
28.Parunak, H. V. D., 1991, "Characterizing the Manufacturing Scheduling Problem", Journal of Manufacturing Systems, Vol. 10, pp.241-259.
29.Pinedo, M., 1995, “Scheduling Theory, Algorithms, and Systems,” Prentice Hall, New Jersey.
30.Rajendran, C., Holthaus, O., 1999. “A comparative study of dispatching rules in dynamic flowshops and jobshops,” European Journal of Operational Research, Vol. 116, pp. 156-170.
31.Rajendran, C. and Holthaus, O., 1999, “A comparative study of dispatching rules in dynamic flowshops and jobshops,” European Journal of Operational Research, Vol. 116, pp. 156-170.
32.Ramasesh, R., 1990, “Dynamic job shop scheduling: a survey of simulation research,” Omega, 18(1), pp. 43-57.
33.Sadeh N., 1991, "Look-Ahead Techniques for Micro-Opportunistic Job Shop Scheduling", Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
34.Sarper, H. and Henry, M., 1996, “Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop,” Omega, 24(1), pp. 73-81.
35.Stecke, K. E., and J. J. Solberg. 1981. “Loading and Control Procedures for Flexible Manufacturing Systems,” International Journal of Production Research, No. 19, 481-490.
36.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, 6(4), pp. 301-310.
37.Wilbrecht, T. J. and Presscott, W. R., 1969. “The influence of setup time on job shop performance,” Management Science, Vol. 16, pp. 274-280.
38.Yang, S. and Wang, D., 2000, "Constraint Satisfaction Adaptive Neural Network and Heuristics Combined Approaches for Generalized Job-Shop Scheduling", IEEE Transactions on Neural Networks, Vol. 11, No. 2, March, pp.474-486. |
