QQ客服 官方微博 反馈留言

	No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm
	Pan, Quan-Ke ; Wang, Ling
	2010-05-06 ; 2010-05-06
关键词	No-idle flow shop Makespan Discrete particle swarm optimization Insert neighborhood Speed-up method Local search MAKESPAN CRITERION SEQUENCING PROBLEM WAIT MINIMIZE MACHINE MAX Automation & Control Systems Engineering, Manufacturing
中文摘要	A novel hybrid discrete particle swarm optimization (HDPSO) algorithm is proposed in this paper to solve the no-idle permutation flow shop scheduling problems with the criterion to minimize the maximum completion time (makespan). Firstly, two simple approaches are presented to calculate the makespan of a job permutation. Secondly, a speed-up method is proposed to evaluate the whole insert neighborhood of a job permutation with (n-1)(2) neighbors in time O(mn(2)), where n and m denote the number of jobs and machines, respectively. Thirdly, a discrete particle swarm optimization (DPSO) algorithm based on permutation representation and a local search algorithm based on the insert neighborhood are fused to enhance the searching ability and to balance the exploration and exploitation. Then, computational simulation results based on the well-known benchmarks and statistical performance comparisons are provided. It is concluded that the proposed HDPSO algorithm is not only superior to two recently published heuristics, the improved greedy (IG) heuristic and Kalczynski-Kamburowski (KK) heuristic, in terms of searching quality, but also superior to the single DPSO algorithm and the PSO algorithm with variable neighborhood search (PSOvns) in terms of searching quality, robustness and efficiency.
语种	英语 ; 英语
出版者	SPRINGER LONDON LTD ; ARTINGTON ; ASHBOURNE HOUSE, THE GUILDWAY, OLD PORTSMOUTH ROAD, ARTINGTON GU3 1LP, GUILDFORD, ENGLAND
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/9013]
专题	清华大学
推荐引用方式 GB/T 7714	Pan, Quan-Ke,Wang, Ling. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm[J],2010, 2010.
APA	Pan, Quan-Ke,&Wang, Ling.(2010).No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm..
MLA	Pan, Quan-Ke,et al."No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。