{"references": ["Al-Hinai, N. and ELMekkawy, T.Y.; (2011) \"Robust and stable flexible\njob shop scheduling with random machine breakdowns using a hybrid\ngenetic algorithm\", International Journal of Production Economics, Vol.\n132, pp 279-291.", "Allahverdi, A., Ng, C.T., Cheng, T.C.E. and Kovalyov Y. M. (2008), A\nsurvey of scheduling problems with setup times or costs, European\njournal of Operational Research, Vol. 187, pp 985-1032.", "Asadzadeh, L. and Zamanifar, K.; (2010) \"An Agent Based Parallel\nApproach for the Job Shop Scheduling Problem with Genetic\nAlgorithm\". Mathematical and Computer Modelling, Vol. 52, pp 1957-\n1965.", "Bagheri, A. and Zandieh, M. (2011) \"Bi-criteria flexible job shop\nscheduling with sequence-dependent setup times-Variable neighborhood\nsearch approach\" Journal of Manufacturing Systems, Vol. 30, pp 8-15.", "Chen, J.C., Wu, C.C., Chen, C.W. and Chen, K.H. (2012) \"Flexible Job\nShop Scheduling with Parallel Machines using Genetic Algorithm and\nGrouping Genetic Algorithm\". Expert System with Applications, Vol.\n39, pp 10016-10021.", "Deb, K. (2003), Optimization for Engineering Design, Algorithm and\nExamples, Prentice Hall, New Delhi, India.", "Dhingra, A. (2010), \"Multi objective flow shop scheduling using\nmetaheuristics\", unpublished Ph.D. dissertation, N.I.T. Kurukshetra.", "Luh P.B., Gou, L., Zhang, Y., Nagahora, T., Tsuji, M., Yoneda, K.,\nHasegawa, T., Kyoya, Y., and Kano, T. (1998), \"Job shop scheduling\nwith group dependent setup, finite buffers and long time horizon\",\nJournal of Annals of Operation Research, Vol. 76, pp233-259", "Mitchell, M. (2002), An introduction to genetic algorithm, Prentice Hall,\nNew Delhi, India.\n[10] Moghaddas, R. and Houshmand, M. \"Job Shop Scheduling Problem\nwith Sequence Dependent Setup Times\". Multi Conference of Engineers\nand Computer Scientists, March 19-21, 2008, Hong Kong.\n[11] Moon, I., Lee, S. and Bae, H. (2008) \"Genetic Algorithms for Job Shop\nScheduling Problems with Alternate Routings\". International Journal of\nProduction Research, Vol. 46, pp 2695-2705.\n[12] Motaghedi, A., Sabri-laghaie, K. and Heydari, M. (2010) \"Solving\nFlexible Job Shop Scheduling with Multi Objective Approach\".\nInternational Journal of Industrial Engineering & Production Research,\nVol. 21, pp 197-209.\n[13] Mousakhani, M. (2013), \"Sequence Dependent Setup Times Flexible\nJob Shop Scheduling Problem to Minimize Total Tardiness\".\nInternational Journal of Production Research available online:\nhttp://dx.doi.org/10.1080/00207543.2012.746480\n[14] Naderi, B., Ghomi S.M.T.F. and Aminnayeri, M. (2010) \"A high\nperforming metaheuristic for job shop scheduling with sequence\ndependent setup times\", Applied Soft Computing 10 (2010) pp 703-710\n[15] Parjapati, S.K. (2013), \"Flexible job shop scheduling optimization with\nsequence dependent set up times using genetic algorithm approach\",\nunpublished M.Tech. dissertation, N.I.T., Kurukshetra.\n[16] Pinedo, M. (2001), Scheduling: Theory, Algorithm, and Systems,\nPrentice Hall, New York.\n[17] Ruiz, R. and Maroto, C. (2006), \"A genetic algorithm for hybrid flow\nshops with sequence dependent setup times and machine eligibility\",\nEuropean Journal of Operational Research, Vol. 169, pp 781-800.\n[18] Roshanaei, V., Esfehani, M.M.S. and Zandieh, M. (2010) \" Integrating\nnon-preemptive open shop scheduling with sequence-dependent setup\ntimes using advanced metaheuristics\", Expert Systems with\nApplications, Vol. 37, pp 259-266\n[19] Tang, J., Zhang, G., Lin, B. and Zhang B. (2011) \"A Hybrid Algorithm\nfor Flexible Job-Shop Scheduling Problem\". Advanced in Control\nEngineering and Information Science, Vol. 15, pp 3678-3683.\n[20] Wang, L., Wang, S. and Liu, M. (2013) \"A Pareto Based Estimation of\nDistribution Algorithm for the Multi Objective Flexible Job Shop Scheduling Problem\". International Journal of Production Research,\navailable online: http://dx.doi.org/10.1080/00207543.2012.752588\n[21] Wang, Y.M., Li, H.Y. and Wang, J. (2009), \"Genetic Algorithm with\nNew Encoding Scheme for Job Shop Scheduling\". International Journal\nof Advanced Manufacturing Technology. Vol. 44, pp 977-984.\n[22] Xing, Y.J., Wang, Z. Q., Sun, J. and Meng, J.J. (2006), \"A Multi\nObjective Fuzzy Genetic Algorithm for Job Shop Scheduling Problems\",\nJournal of Achievements in Material and Engineering, Vol. 17, Issue 1-\n2, pp 297-300.\n[23] Xu, L., Shuang, W. and Ming, H. (2009), \"Application on Job Shop\nScheduling with Genetic Algorithm based on Mixed Strategy\". IEEE\nInternational Conference on Chinese Control and Decision 2009, pp\n2007-2009 Guilin.\n[24] Zhang G., Shao X., Li P. and Gao L. (2009) \"An effective hybrid\nparticle swarm optimization algorithm for multi-objective flexible jobshop\nscheduling problem\", Computer and industrial engineering, Vol.\n56, pp 1309-1318.\n[25] Ziaee, M. (2014) \" An Efficient Heuristic Algorithm for Flexible Job\nShop Scheduling with maintenance Constrain\" Applied Mathematics\nand Sciences, Vol. 1, No. 1, May 2014"]}

This paper presents optimization of makespan for ‘n’ jobs and ‘m’ machines flexible job shop scheduling problem with sequence dependent setup time using genetic algorithm (GA) approach. A restart scheme has also been applied to prevent the premature convergence. Two case studies are taken into consideration. Results are obtained by considering crossover probability (pc = 0.85) and mutation probability (pm = 0.15). Five simulation runs for each case study are taken and minimum value among them is taken as optimal makespan. Results indicate that optimal makespan can be achieved with more than one sequence of jobs in a production order.