id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_ztvalqgjlna2fhj7accs4tukde	D.Y. Sha	A multi-objective PSO for job-shop scheduling problems	2010	21	.pdf	application/pdf	5335	643	69	_ESWA_A multi-objective PSO for job-shop scheduling problems A multi-objective PSO for job-shop scheduling problems Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal Keywords: job-shop scheduling; particle swarm optimization; multiple objectives The job-shop scheduling problem (JSP) has been studied for more than 50 years in both academic and industrial Most studies of single-objective JSPs result in a schedule to minimize the time required to complete all jobs, i.e., for resolving job-shop problems with objective functions that consider minimization of makespan, total For an n-job m-machine problem, the position of particle k can be represented by The proposed multi-objective PSO (MOPSO) algorithm was tested on benchmark problems obtained from "A Pareto archive particle swarm optimization for multi-objective job shop scheduling," Computers & Industrial "A particle swarm optimization-based algorithm for job-shop scheduling & Hsu, C.-Y., 2006, "A hybrid particle swarm optimization for job shop scheduling problem," Computers & Industrial 	./cache/work_ztvalqgjlna2fhj7accs4tukde.pdf	./txt/work_ztvalqgjlna2fhj7accs4tukde.txt