Production Scheduling for Flexible Flowshop using Genetic Algorithms

Main Article Content

Boonchuay Srithammasak
Weerapan Sae-Dan


- This paper was to study the production scheduling for the industry enabling to change the product form according to customer’s order. From a variety of products lengthened the process steps and time. The paper studied how to schedule the production table for increasing the efficiency of flexible flow system scheduling. The two state units were experimented. Each unit consisted of unrelated parallel machines. Then, based on the customer’s needs, the flexible flow system production tables were scheduled with the genetic method. The experiment with data characterized by a normal distribution as the number of 20, 50, 80 and 107 jobs was implemented. The results showed that the production scheduling with the genetic method enabled to reduce the production time from 14 days into 12.4 days, or 11.42 percent, and the time analysis of the program processing had the significant relation to the number of the jobs, and the number of the search model.

Article Details

How to Cite
B. Srithammasak and W. Sae-Dan, “Production Scheduling for Flexible Flowshop using Genetic Algorithms”, JIST, vol. 4, no. 2, pp. 35–38, Dec. 2013.
Research Article: Soft Computing (Detail in Scope of Journal)


1. Bor-Wen Cheng, Chun-Lang Chang., “A Study on flow shop scheduling problemcombining Taguchi Experiment design and genetic algorithms.” Expert System withApplication, 2006.

2. Chae Y. Lee, "Genetic Algorithm for single Machine Job Scheduling with Common Due Dateand Symetric Penalties", Journal of the Operation Research Society of Japan, Vol37, No.2June 1994.

3. Fink, A., and Vob, S.,"Soloving the continuous flowshop scheduling problem bymetaheuristics", European Journal of Operation Research 151, 400-414, 2003.

4. Khammuang, K., "A Genetic algorithm for the cell formation problem with routingflexibility", Master thesis, Asian Institute of Technology, Thailand, 2000.

5. Kumar, S. and Harms, R.,“Improving business process for increased operationalefficiency: a case study”, Journal of Manufacturing Technology Management, 15(7), 667-674, 2004.

6. Masato Watanabe, Kenichi Ida and Mitsuo Gen., “A genetic algorithms with modifiedcrossover operator and search area adaptation for the job-shop scheduling problem.” Computers & Industrial Engineering. 48(2005): 743-752.

7. Melanie Mitchell., “An Introduction to Genetic Algorithms", London: MIT Press, 1998.