|
1. Baker, K. R., (1974). Introduction to sequencing and scheduling. John Wiley & Sons, New York. 2. Baker, K. R., Balas, E., and Zawack, D., (1998). The shifting bottleneck procedure for job-shop scheduling. Management Science, 34: pp.391-401. 3. Beasly, J. E., (1990). OR-library: Distribution Test Problems by Electronic Mail, Journal of the Operational Research Society, 41, no.11. http://mscmga.ms.ic.ac.uk/info.html. 4. Bispo, C. F., and Tayur, S., (2001). Managing simple re-entrant flow lines: theoretical foundation and experimental results. IIE Transactions, 33: pp.609-623. 5. Bjegal, J. E., and Davern, J. J., (1990). Genetic algorithms and job shop scheduling. Computers and Industrial Engineering 19. 6. Blazewicz, J., Ecker, K., Schmidt, G.., and Weglarz, J., (1993). Scheduling in computer and manufacturing Systems. Springer, Berlin. 7. Bowden, Jr., R. O., (1992). Genetic algorithm based machine learning applied to the dynamic routing of discrete parts. Dissertation, Department of Industrial Engineering, Mississippi State University. 8. Campbell, H., Dudek, R., and Smith, M., (1970). A heuristic algorithm for the n-job m-mahcine sequencing problem. Management Science, 16B: pp.630-637. 9. Chen, C., Vempati, V., and Ajabber, N., (1995). An application of genetic algorithms for flow shop problems. European Journal of Operational Research, 80: pp.389-396. 10. Cheng, R., (1997). A study on genetic algorithms-based optimal scheduling techniques. PhD thesis, Tokyo Institute of Technology. 11. Cheng, R, Gen, M., and Tsujimura, Y., (1996). A tutorial survey of job-shop scheduling problems using genetic algorithms, part Ⅰ: International Journal of Computers and Industrial Engineering, 30: pp.983-997. 12. Cheng, R. Gen, M. and Tsujimura, Y., (1999). A tutorial survey of job-shop scheduling problems using genetic algorithms, part Ⅱ: hybrid genetic: genetic search strategies, Computers and Operations Research, 36: pp.343-364. 13. Cleveland, G. A., and Smith, S.F., (1989). Using genetic algorithms to schedule flow shop release. in: J. D. Schaffer (ed.), Proceedings of the Third International Conference on Genetic Algorithms Applications, Morgan Kanufmann, San Mateo, CA, pp.160-169. 14. Conway, R., Maxwell, W., and Miller, L., (1967). Theory of scheduling. Addison-Wesley. 15. Dannenbring, D. G.., (1977). An evaluation of flow shop sequencing heuristics. Management Science, 23: pp.1174-1182. 16. Davis, L., (1985). Job shop scheduling with genetic algorithms. in: J. J. Grefenstette (ed.), Proceedings of an International Conference on Genetic Algorithms and Their Applications, Carnegie-Mellon University, Pittsburgh, PA, pp.136-140. 17. Demirkol, E., Uzsoy R., (2000). Decomposition methods for reentrant flow shops with sequence-dependent setup times. Journal of Scheduling, 3: pp.155-177. 18. French, S., (1982). Sequencing and scheduling: An introduction to the mathematics of the job-shop. Ellis Horwood, Chichester, U. K. 19. Garey, M.R., Johnson, D.S., and Sethi, R., (1976). The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research, 1: pp.117-129. 20. Gillies, A., (1985). Machine learning procedures for generating image domain feature detectors. Ph. D. thesis, University of Michigan, Ann Arbor. 21. Goldberg, D. E., (1989). Genetic algorithms in search. Optimization and Machine Learning, Addison-Wesley, Reading, Ma. 22. Goldberg, D.E., and Lingle, Jr., R., (1985). Alleles, loci and the Traveling Salesman Problem, in: J. J. grefenstette(ed.)k Proceedings of an International Conference on Genetic Algorithms and Their Applications, Carnegie-Mellon University, Pittsburgh, PA, pp.154-159. 23. Graves, S. C., Meal, H.C., Stefek, D., Zeghmi, A.H., (1983). Scheduling of re-entrant flow shops. Journal of Operations Management, 3: pp.197-207. 24. Grefenstette, J. and Baker, J., How genetic algorithms work: a critical look at implicit parallelism. in Schaffer, pp.20-27. 25. Grefenstette, J., Gopal, R., Rosmaita, B., and Van Gucht, D., (1985) Genetic algorithm for the traveling salesman problem, in: J.J. Grefenstette (ed.), Proceedings of an International Conference on Genetic Algorithms and Their Applications, Carnegie-Mellon University, Pittsburgh, PA, pp.160-168. 26. Gupta J. N. D. (1971). A functional heuristic algorithm for the flow shop scheduling problem. Operations Research. 22: pp.39-47. 27. Holland, J., (1975). Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor. 28. Hwang, H. and Sun, J. U., (1998). Production sequencing problem with re-entrant work flows and sequence dependent setup times. International Journal of Production Research, 36: pp.2435-2450. 29. Johnson, S. M., (1954). Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist., 1: pp.287-326 30. Kubiak W, Lou SXC, Wang, Y. M., (1996). Mean flow time minimizations in re-entrant job shops with hub. Operations Research, 44: pp764-776. 31. Kubota, A., (1995). Study on optimal scheduling for manufacturing system by genetic algorithms. Master’s thesis, Ashikaga Institute of Technology, Ashikaga, Japan. 32. Manne, A. S., (1960). On the job-shop scheduling problem. Operations Research. 8: pp.219223. 33. Michalewicz, Z., (1994). Genetic Algorithm + Data Structure = Evolution Programs, 2nd ed., Springer-Verlag, New York. 34. Murata, T., Ishibuchi, H. and Tanaka, H., (1996). Genetic algorithms for flows shop scheduling problems. Computers Industrial Engineering, 30: pp.1061-1071. 35. Nawaz, M., Enscore, E., and Ham, I., (1983). A heuristic algorithm for the m-machine n-job flow shop sequencing problem. Omega, 11: pp.11-95. 36. Palmer, D. S. (1965). Sequencing jobs through a multi-stage process in the minimum total time-A quick method of obtaining a near optimum. Operations Research. 16: pp.101-107. 37. Pan, J. C. H. and Chen, J. S., (2003). A comparative study of scheduling-generation procedures for the reentrant shops scheduling problem. Accepted by International Journal of Industrial Engineering. 38. Pan, J. C. H. and Chen, J. S., (2003). Minimizing makespan in reentrant permutation flow-shops. Accepted by Journal of the Operational Research Society. 39. Pinedo, M., (1995). Scheduling: theory, algorithms, and systems. Prentice-Hall, New Jersey. 40. Reeves, C. and Wright, C., (1995). A genetic algorithm for flow shop sequencing. Computers and Operations Research, 22: pp.5-13. 41. Rinnooy Kan, A. H. G., (1976). Machine Scheduling Problems: Classification, Complexity and Computations. Martinus Nijhoff, The Hague. 42. Sannomiya, N. and Iima, H., (1996). Application of genetic algorithms to scheduling problems in manufacturing process. in Fogel, pp523-528. 43. Tsujimura, Y., Gern, M. Parts loading scheduling in a flexible forging machine using an advanced genetic algorithm. Journal of Intelligent Manufacturing, 10(2): pp.49-56. 44. Tsujimura, Y., M. Gen and Kubota, E., (1995). Flow-shop scheduling with fuzzy processing time using genetic algorithms. The 11th Fuzzy Systems Symposium, Okinawa.(in Japan): pp.248-252. 45. Vargas-Villamil, F. D. and Rivera, D. E. (2001). A model predictive control approach for real-time optimization of reentrant manufacturing lines. Computers in Industry, 45: pp.45-57. 46. Wagner, H. M. (1959). An integer linear-programming model for machine scheduling. Naval Res Logist. 6: pp.131140. 47. Wang, M. Y., Sethi SP and Van De Velde SL (1997). Minimizing makespan in a class of reentrant shops. Operations Research 45: pp.702-712. 48. Whitley, D., Starkwether, T., and Shaneer, D., (1991). The Traveling Salesman and Sequence Scheduling Problems: Quality solutions using genetic edge recombination, in: L. Davis (ed.), Handbook of Genetic Algorithms, van Nostrand Reinhold, New York, pp.350-372. 49. Wilson, J. M. (1989). Alternative formulations of a flow-shop scheduling problem. Operations Research. 40: pp.395399.
|