Browse > Article
http://dx.doi.org/10.7315/CADCAM.2013.129

Genetic Algorithms for Tire Mixing Process Scheduling  

Ahn, Euikoog (Department of Industrial Engineering, Ajou University)
Park, Sang Chul (Department of Industrial Engineering, Ajou University)
Publication Information
Korean Journal of Computational Design and Engineering / v.18, no.2, 2013 , pp. 129-137 More about this Journal
Abstract
This paper proposed the scheduling method for tire mixing processes using the genetic algorithm. The characteristics of tire mixing process have the manufacturing routing, operation machine and operation time by compound types. Therefore, the production scheduling has to consider characteristics of the tire mixing process. For the reflection of the characteristics, we reviewed tire mixing processes. Also, this paper introduces the genetic algorithm using the crossover and elitist preserving selection strategy. Fitness is measured by the makespan. The proposed genetic algorithm has been implemented and tested with two examples. Experimental results showed that the proposed algorithm is superior to conventional heuristic algorithm.
Keywords
Tire mixing process; Production scheduling; Job shop; Genetic algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Park, S. J., Kim, J. W. and Kim, H. W., 1996, Heuristic Knowledge Representation of Production Scheduling: An Integrated Modeling Approach, Expert System With Applications, Vol. 10, No. 3, pp. 325-339.   DOI   ScienceOn
2 Chung, J. B. and Yoon, J. H. 2009, The Implementation of a Production Planning System in a Tire Manufacturing Company: Case Study, Entrue Journal of Information Technology, Vol. 8, No. 1.
3 http://www.eng.buffalo.edu/Courses/ce435/2001ZGu/ Firestone_Tires/FirestoneTiresReport.htm
4 Kim, H. W., Kim, T., Cho, J. G. and Moon, S. S., 2000, Tire Engineering, Goldenbell, pp. 64-65.
5 Lee, S. Y., 2010, The World of Artificial Intelligence, 21centries, pp. 400-410.
6 Jeong, Y. S., Yim, H. J. Jee, H. S. and Lee, K. K., 2008, Manufacturing Line Optimization for Discrete Event Simulation and Genetic Algorithm, Transactions of the Society of CAD/CAM Engineers, Vol. 13, No. 1, pp. 67-75.
7 Cheng, R. and Gen, M., 1997, Resource Constrained Project Scheduling Problem Using Genetic Algorithms, International Journal of Intelligent Automation and Soft Computing, Vol. 3, No. 3, pp. 273-286.   DOI
8 Moon, D. H. and Chang, K. K., 2000, A Simulation Model for Supporting System Design of Tire Manufacturing System, Korean Simulation Association, Vol.9 No.2, pp. 27-38.
9 Carlier, J. and Pinson, E., 1989, An Algorithm for Solving the Job-shop Problem, Management Science, Vol. 35, No. 2, pp. 164-176.   DOI   ScienceOn
10 Joseph Adams, Egon Balas, and Daniel Zawack- Reviewed, 1988, The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science, Vol. 34, No. 3, pp. 391-401.   DOI   ScienceOn
11 Kenneth R. Baker, 1974, Introduction to Sequencing and Scheduling, John Wiley & Sons, Inc, pp. 178-210.
12 Nabil Nasr and Elsayed, E. A., 1990, Job Shop Scheduling with Alternative Machines, International Journal of Production Research, Vol. 28, No. 9, pp. 1595-1609.   DOI
13 Park, J.-H., Choi, Hoeryron and Kim, Y. H., 1998, A Genetic Algorithm Approach to Job Shop Scheduling Considering Alternative Process Plans, Journal of the Korean Institute of Industrial Engineers, Vol. 24, No. 4 pp. 130-145.   과학기술학회마을
14 Moon, I. K., Lee, S. H. and Bae, H. R., 2008, Genetic Algorithms for Job Shop Scheduling Problems with Alternative Routings, International Journal of Production Research, Vol. 46, No. 10, pp. 2695-2705.   DOI   ScienceOn
15 Hong Zhou, Yuncheng Feng, and Limin Han, 2001, The Hybrid Heuristic Genetic Algorithm for Job Shop Scheduling, Computers & Industrial Engineering,Vol. 40, No. 3, pp. 191-200.   DOI   ScienceOn