QQ客服 官方微博 反馈留言

	An improved version of the NEH algorithm and its application to large-scale flow-shop scheduling problems
	Jin, Feng ; Song, Shiji ; Wu, Cheng
	2010-05-06 ; 2010-05-06
关键词	flow-shop scheduling problem NEH algorithm block property TABU SEARCH ALGORITHM HEURISTIC ALGORITHM SEQUENCING PROBLEM SHOP PROBLEM PERMUTATION Engineering, Industrial Operations Research & Management Science
中文摘要	This paper deals with the Flow-shop Scheduling Problem (FSP). The NEH algorithm is regarded as one of the best constructive methods for solving the FSP. However, the running time of the NEH algorithm when used to solve large-scale FSPs is fairly long. The block properties of the FSP are investigated to reduce the running time. Using these block properties it is found that if a partial schedule is evaluated, the lower bounds of other partial makespans can be obtained in a time of O(1). A pruning procedure based on the block properties of the FSP is introduced into the NEH algorithm to reduce the computational complexity. Experimental results show that the improved NEH algorithm has a greatly reduced running time compared with the classical NEH algorithm. It takes less than 0.2 seconds on average to get a solution for a large-scale FSP (up to 500 jobs and 20 machines).
语种	英语 ; 英语
出版者	TAYLOR & FRANCIS INC ; PHILADELPHIA ; 325 CHESTNUT ST, SUITE 800, PHILADELPHIA, PA 19106 USA
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/9319]
专题	清华大学
推荐引用方式 GB/T 7714	Jin, Feng,Song, Shiji,Wu, Cheng. An improved version of the NEH algorithm and its application to large-scale flow-shop scheduling problems[J],2010, 2010.
APA	Jin, Feng,Song, Shiji,&Wu, Cheng.(2010).An improved version of the NEH algorithm and its application to large-scale flow-shop scheduling problems..
MLA	Jin, Feng,et al."An improved version of the NEH algorithm and its application to large-scale flow-shop scheduling problems".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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