Industrial Engineering and Management Systems

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

A Taguchi Approach to Parameter Setting in a Genetic Algorithm for General Job Shop Scheduling Problem

  • Sun, Ji Ung (School of Industrial & Managment Engineering Hankuk University of Foreign Studies)
  • Published : 2007.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

The most difficult and time-intensive issue in the successful implementation of genetic algorithms is to find good parameter setting, one of the most popular subjects of current research in genetic algorithms. In this study, we present a new efficient experimental design method for parameter optimization in a genetic algorithm for general job shop scheduling problem using the Taguchi method. Four genetic parameters including the population size, the crossover rate, the mutation rate, and the stopping condition are treated as design factors. For the performance characteristic, makespan is adopted. The number of jobs, the number of operations required to be processed in each job, and the number of machines are considered as noise factors in generating various job shop environments. A robust design experiment with inner and outer orthogonal arrays is conducted by computer simulation, and the optimal parameter setting is presented which consists of a combination of the level of each design factor. The validity of the optimal parameter setting is investigated by comparing its SN ratios with those obtained by an experiment with full factorial designs.

Keywords

References

  1. Ballas, E. (1969), Machine sequencing via disjunctive graphs: an implicit enumeration approach, Operations Research, 17, 941-957. https://doi.org/10.1287/opre.17.6.941
  2. Chen, C. L., Vempati, V. S., and Aljaber, N. (1995), An application of genetic algorithms for flow shop problems, European Journal of Operations Research, 80, 389-396. https://doi.org/10.1016/0377-2217(93)E0228-P
  3. Cheng, R., Gen, M., and Tsujimura, Y. (1996), A tutorial survey of job-shop scheduling problems using genetic algorithms, part I: representation, Computers and Industrial Egningeering, 30, 983-996. https://doi.org/10.1016/0360-8352(96)00047-2
  4. Cheng, R., Gen, M., and Tsujimura, Y. (1999), A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies, Computers and Industrial Egningeering, 36, 343-364. https://doi.org/10.1016/S0360-8352(99)00136-9
  5. Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning. Reading, Massachusetts: Addison Wesley.
  6. Gupta, M, Gupta, Y., and Kumar, A. (1993), Minimizing flow time variance in single machine system using genetic algorithms, European Journal of Operations Research, 70, 289-303. https://doi.org/10.1016/0377-2217(93)90240-N
  7. Hsieh, C., Chou, J., and Wu, Y. (2000), Taguchi-MHGA method for optimizing grey-fuzzy gain-scheduler, Proceedings of the 6th International Conference on Automation Technology, Taiwan, 575-582.
  8. Holland, J. (1975), Adaptation in Natural and Artificial Systems, University of Michigan Press.
  9. Koonce, D. A. and Tsai, S. C. (2000), Using data mining to find patterns in genetic agorithm solutions to a job shop schedule, Computers and Industrial Engineering, 38, 361-374. https://doi.org/10.1016/S0360-8352(00)00050-4
  10. Lee, C. Y. and Choi, J. Y. (1995), A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights, Computers and Operations Research, 22, 857-869. https://doi.org/10.1016/0305-0548(94)00073-H
  11. Leung, Y. and Wang, Y. (2001), An orthogonal genetic algorithm with quantization for global numerical optimization, IEEE Transactions on Evolutionary Computation, 5, 41-53. https://doi.org/10.1109/4235.910464
  12. Liu, T., Tsai, J., and Chou, J. (2006), Improved genetic algorithm for the job-shop scheduling problem, International Journal of Advanced Manufacturing Technology, 27, 1021-1029. https://doi.org/10.1007/s00170-004-2283-4
  13. Ovacik, I. M. and Uzsoy, R. (1997), Decomposition methods for complex factory scheduling problems, Norwell, MA: Kluwer Academic.
  14. Pakath, R. and Zaveri, J. S. (1993), Specifying critical inputs in a genetic-driven decision support system: an automated facility, Working Paper, University of Kentucky, Lexington.
  15. Phadke, M. S. (1989), Quality engineering using robust design, Prentice-Hall International.
  16. Schaffer, J. D., Caruana, R. A., Eshelman, L. J., and Das, R. (1989), A study of control parameter affecting online performance of genetic algorithms for function optimization, Proceedings of the 3rd International Conference on Genetic Algorithms, Arlington, VA.
  17. Sun, J. U., Yee, S. R., and Hwang, H. (2003), Job shop scheduling with sequence dependent setup times to minimize makespan, International Journal of Industrial Engineering-Theory, Applications And Practice, 10, 455-461.