id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_cn4tyqxheranlecnhco2xwfcde	F. Choong	Metaheuristic methods in hybrid flow shop scheduling problem	2011	17	.pdf	application/pdf	10851	2033	76	Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent Conventionally, in such problems each machine's job process time current research we focused on a scheduling problem which a job is processed at the upstream stage and all the downstream machines get paper proposes a new more realistic mathematical model which considers both the PM and holding cost of jobs inside the buffers in the optimization algorithm (PSO) and parallel simulated annealing (PSA) methods under different random generation policies. Computational experiments revealed that the proposed algorithms embedboth desirable accuracy and CPU time. Among them, the PSO-PSAП outperforms than other algorithms in terms of makespan and CPU time especially for large size problems. Keywords: Stochastic flexible flow shop; Budget constraint, Preventive maintenance; Genetic algorithm; Simulated annealing; Particle makespan, and the second stage was optimized the biobjective function and integrates machines assignments 	./cache/work_cn4tyqxheranlecnhco2xwfcde.pdf	./txt/work_cn4tyqxheranlecnhco2xwfcde.txt