id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_yjmptpq6ezd33c2m2i7y2tkhke	Andrea Rossi	Scheduling flow lines with buffers by ant colony digraph	2013	21	.pdf	application/pdf	10925	1384	72	Keywords: Flexible Manufacturing Systems (FMS), Native Non-Permutation Flowshop Scheduling (NPFS), The job sequence of each machine remains unchanged in a permutation flowshop (PFS) scheduling, while in a non-permutation flowshop (NPFS) the sequence of jobs can be different on subsequent machines. The genesis of native Non-Permutation Flowshop Scheduling (NPFS) and alternatives from the literature to model and approach In their last approach, Lin and Ying use a PFS schedule as the initial solution of their tabu search (non-native). Disjunctive graph (digraph) for flowshop scheduling, with processing times p i j at nodes O i j for n (=4) jobs on m (=4) machines or approach to generate an acyclic digraph is proposed by Rossi and Dini (2007) considering the list scheduler heuristic method and which fulfills all the problem constraints (2) to (8) to generate native non-permutation flowshop schedules. The proposed native-NPFS ACO based on the list scheduling heuristics described guides ants to select the most 	./cache/work_yjmptpq6ezd33c2m2i7y2tkhke.pdf	./txt/work_yjmptpq6ezd33c2m2i7y2tkhke.txt