References

Adibi, M.A., M. Zandieh and M. Amiri, 2010. Multiobjective scheduling of dynamic job shop using variable neighborhood search. Expert Syst. Appl., 37: 282-287.
CrossRef  |  

Beasley, J.E., 1990. OR-library: Distributing test problems by electronic mail. J. Oper. Res. Soc., 41: 1069-1072.
Direct Link  |  

Bierwirth, C., 1995. A generalized permutation approach to job shop scheduling with genetic algorithm. OR Spectrum, 17: 87-92.
CrossRef  |  

Chang, P.T. and Y.T. Lo, 2001. Modeling of jobshop scheduling with multiple quantitative and qualitative objectives and a GA/TS mixture approach. Int. J. Comput. Integr. Manuf., 14: 367-384.
Direct Link  |  

Datta, D., K. Deb, and C.M. Fonseca, 2007. Multi-objective evolutionary algorithm for university class timetabling problem. Evol. Scheduling, 49: 197-236.
CrossRef  |  

Garey, M.R., D.S. Johnson and R. Sethi, 1976. The complexity of flow shop and job shop scheduleing. Math. Operat. Res., 1: 117-129.
CrossRef  |  

Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. 1st Edn., Addison-Wesley Professional, Boston, MA., USA., ISBN-13: 9780201157673, Pages: 412.

Kamrul Hasan, S.M., M.R. Sarker and D. Cornforth, 2007. Hybrid genetic algorithm for solving job-shop scheduling problem. Proceedings of the 6th IEEE/ACIS International Conference on Computer and Information Science, July 11-13, 2007, Melbourne, Australia, pp: 519-524.

Kobayashi, S., I. Ono and S. Yamamura, 1995. An efficient genetic algorithm for job shop scheduling problems. Proceedings of the 6th International Conference on Genetic Algorithms, July 15-19, 1995, Pittsburgh, PA., USA., pp: 506-511.

Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, 1993. Sequencing and scheduling: Algorithms and complexity. Handbooks Oper. Res. Manage. Sci., 4: 445-552.
CrossRef  |  

Lee, K.M.,T. Yamakawa and K.M. Lee, 1998. A genetic algorithm for general machine scheduling problems. Proceedings of the 2nd International Conference on Knowledge-Based Electronic System, Volume 2, April 21-23, 1998, Adelaide, SA., USA., pp: 60-66.

Qi, J.G., G.R. Burns and D.K. Harrison, 2001. The application of parallel multi population genetic algorithms to dynamic job-shop scheduling. Int. J. Adv. Manuf. Technol., 16: 609-615.
CrossRef  |  

Royachka, K. and M. Karova, 2006. High-performance optimization of genetic algorithms. Proceedigs of the IEEE International Spring Seminar on Electronics Technology, May 10-14, 2006, St. Marienthal, pp: 395-400.

Schaerf, A., 1999. A Survey of automated timetabling. Artif. Intell. Rev., 13: 87-127.
CrossRef  |  

Sivanandam, S.N. and S.N. Deepa, 2010. Introduction to Genetic Algorithm. Springer, New York, ISBN: 9783642092244, Pages: 442.

Yamada, T. and R. Nakano, 1996. A fusion of crossover and local search. Proceedings of the IEEE International Conference on Industrial Technology, December 2-6, 1996, Shanghai, pp: 426-430.

Yamada, T. and R. Nakano, 1997. Job Shop Scheduling. In: Genetic Algorithms in Engineering Systems, Ali Zalzala, M.S. and P.J. Fleming (Eds.). IET, London, UK., ISBN: 9780852969021, Pages: 263.

Yamada, T., 2003. Studies on metaheuristics for job shop and flow shop scheduling problems. Kyoto University, Japan, http://www.kecl.ntt.co.jp/as/members/yamada/YamadaThesis.pdf.

Zhang, R., 2011. A particle swarm optimization algorithm based on local perturbations for the job shop scheduling problem. Int. J. Adv. Comput. Technol., 3: 256-264.
Direct Link  |