id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
american_scientific_journal-3900	Ahmed, Md. Humayan; Ema, Romana Rahman; Islam, Tajul; M Pir, Rana	Application of an Efficient Genetic Algorithm for Solving n×m Flow Shop Scheduling Problem Comparing it with Branch and Bound Algorithm and Tabu Search Algorithm	2018	14	.pdf	application/pdf	4411	300	66	Flow shop scheduling problem is considered NP-hard for m machines and n jobs. Lomnicki [13] has proposed a Branch and Bound method for flow shop scheduling problem.	cache/american_scientific_journal-3900.pdf	txt/american_scientific_journal-3900.txt