@article{(Open Science Index):https://publications.waset.org/pdf/7321,
	  title     = {An Effective Hybrid Genetic Algorithm for Job Shop Scheduling Problem},
	  author    = {Bin Cai and  Shilong Wang and  Haibo Hu},
	  country	= {},
	  institution	= {},
	  abstract     = {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.
},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {5},
	  number    = {10},
	  year      = {2011},
	  pages     = {1144 - 1150},
	  ee        = {https://publications.waset.org/pdf/7321},
	  url   	= {https://publications.waset.org/vol/58},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 58, 2011},
	}