@techreport{TD:5EAL6J,
	att_abstract={{This paper presents a hybrid genetic algorithm for the Job Shop Scheduling  problem. The chromosome representation of the problem is based on random  keys. The schedules are constructed using a priority rule in which the  priorities are defined by the genetic algorithm. Schedules are constructed  using a procedure that generates parameterized active schedules. After a  schedule is obtained a local search heuristic is applied to improve the  solution. 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. }},
	att_authors={mr5626},
	att_categories={},
	att_copyright={{Elsevier}},
	att_copyright_notice={{}},
	att_donotupload={true},
	att_private={false},
	att_projects={},
	att_tags={Job Shop, Heuristics, Scheduling, Random Keys, Genetic Algorithm},
	att_techdoc={true},
	att_techdoc_key={TD:5EAL6J},
	att_url={},
	author={Mauricio Resende and José Gonçalves and José Gonçalves and Jorge José Mendes},
	institution={{European Journal of Operational Research}},
	month={September},
	title={{Hybrid genetic algorithm for the job shop scheduling problem}},
	year=2002,
}