期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 59, 期 2, 页码 323-333出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2010.05.004
关键词
Scheduling; Flexible job shop problem; Hybrid metaheuristics; Tabu search; Population-based algorithm
资金
- Polish Ministry of Science and Higher Education [N N514 232237]
A parallel approach to flexible job shop scheduling problem is presented in this paper. We propose two double-level parallel metaheuristic algorithms based on the new method of the neighborhood determination. Algorithms proposed here include two major modules: the machine selection module refer to executed sequentially, and the operation scheduling module executed in parallel. On each level a metaheuristic algorithm is used, therefore we call this method meta(2)heuristics. We carry out a computational experiment using Graphics Processing Units (CPU). It was possible to obtain the new best known solutions for the benchmark instances from the literature. (c) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据