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

CCUR > College of Natural Science and Engineering > College of Engineering > Department of Computer Science and Information Engineering > journal articles > Item 987654321/30759

Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/30759

Title:	A new heuristic based on local best solution for permutation flow shop scheduling
Authors:	Chen, Chun-Lung Tzeng, Yeu-Ruey Chen, Chuen-Lung
Contributors:	Dept Comp Sci & Informat Engn
Keywords:	Scheduling Heuristic Permutation flow shop scheduling Makespan
Date:	2015-04
Issue Date:	2015-10-30 13:56:25 (UTC+8)
Abstract:	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.
Relation:	APPLIED SOFT COMPUTING 卷: 29 頁碼: 75-81
Appears in Collections:	[Department of Computer Science and Information Engineering] journal articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	376	View/Open

View Licence