Please use this identifier to cite or link to this item: https://ah.nccu.edu.tw/handle/140.119/73501


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: 資管系
Keywords: Scheduling;Heuristic;Permutation flow shop scheduling;Makespan
Date: 2015-04
Issue Date: 2015-02-12 14:20:22 (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.
Relation: Applied Soft Computing,29,75-81
Data Type: article
DOI 連結: http://dx.doi.org/10.1016/j.asoc.2014.12.011
Appears in Collections:[資訊管理學系] 期刊論文

Files in This Item:

File Description SizeFormat
75-81.pdf560KbAdobe PDF1280View/Open


All items in 學術集成 are protected by copyright, with all rights reserved.


社群 sharing