A new heuristic based on local best solution for permutation flow shop scheduling

文化大學機構典藏 CCUR > 理工學院 > 工學院 > 資訊工程學系 > 期刊論文 > Item 987654321/30759

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/30759

题名:	A new heuristic based on local best solution for permutation flow shop scheduling
作者:	Chen, Chun-Lung Tzeng, Yeu-Ruey Chen, Chuen-Lung
贡献者:	Dept Comp Sci & Informat Engn
关键词:	Scheduling Heuristic Permutation flow shop scheduling Makespan
日期:	2015-04
上传时间:	2015-10-30 13:56:25 (UTC+8)
摘要:	This paper proposes a population-based heuristic based on the local best solution (HLBS) for the minimization of makespan in permutation flow shop scheduling problems. The proposed heuristic operates through three mechanisms: (i) it introduces a new method to produce a trace-model for guiding the search, (ii) it modifies a filter strategy to filter the solution regions that have been reviewed and guide the search to new solution regions in order to keep the search from trapping into local optima, and (iii) it initiates a new jump strategy to help the search escape if the search is trapped at a local optimum. Computational experiments on the well-known Taillard's benchmark data sets demonstrate that the proposed algorithm generated high quality solutions when compared to existing population-based search algorithms such as genetic algorithms, ant colony optimization, and particle swarm optimization. (C) 2014 Elsevier B.V. All rights reserved.
關聯:	APPLIED SOFT COMPUTING 卷: 29 頁碼: 75-81
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	354	检视/开启

检视Licence

在CCUR中所有的数据项都受到原著作权保护.