@techreport{TD:7Q9RX9,
	att_abstract={{This paper presents a biased random-keys genetic algorithm for the Resource Constrained Project Scheduling Problem. The chromosome representation of the problem is based on random keys. Active schedules are constructed using a priority-rule heuristic in which the priorities of the activities are defined by the genetic algorithm. A forward-backward improvement  procedure is applied to all solutions. The chromosomes supplied by the  genetic algorithm are adjusted to reflect the solutions obtained by the improvement procedure. The heuristic is tested on a set of standard problems taken from the literature and compared with other approaches. The computational  results validate the effectiveness of the proposed algorithm. }},
	att_authors={mr5626},
	att_categories={},
	att_copyright={{}},
	att_copyright_notice={{}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={Resource constrained project scheduling, genetic algorithm, biased random key genetic algorithm},
	att_techdoc={true},
	att_techdoc_key={TD:7Q9RX9},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:7Q9RX9_DS1_2010-08-18T15:18:35.390Z.pdf},
	author={Mauricio Resende and José Gonçalves and Jorge Mendes},
	institution={{}},
	month={April},
	title={{A Biased Random-Key Genetic Algorithm with Forward-Backward Improvement for the Resource Constrained Project Scheduling Problem}},
	year=2010,
}