%0 Journal Article
	%A Bin Cai and  Shilong Wang and  Haibo Hu
	%D 2011
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 58, 2011
	%T An Effective Hybrid Genetic Algorithm for Job Shop Scheduling Problem
	%U https://publications.waset.org/pdf/7321
	%V 58
	%X The job shop scheduling problem (JSSP) is well known as one of the most difficult combinatorial optimization problems. This paper presents a hybrid genetic algorithm for the JSSP with the objective of minimizing makespan. The efficiency of the genetic algorithm is enhanced by integrating it with a local search method. The chromosome representation of the problem is based on operations. Schedules are constructed using a procedure that generates full active schedules. In each generation, a local search heuristic based on Nowicki and Smutnicki-s neighborhood is applied to improve the solutions. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm.

	%P 1144 - 1150