4.6 Article

Multiobjective parallel machine scheduling in the sawmill industry using memetic algorithms

出版社

SPRINGER LONDON LTD
DOI: 10.1007/s00170-014-5957-6

关键词

Multiobjective; Memetic; Tradeoff; Scheduling; Parallel machine; Wood industry

向作者/读者索取更多资源

This study presents a multiobjective optimization algorithm that is termed memetic algorithm with compromise search (MACS). This algorithm, proposed by the authors, combines genetic evolution with local search, in the same way as traditional memetic algorithms, but with the use of independent populations for each objective, as well as a mechanism for finding compromise solutions (tradeoffs) via a local search operator. The algorithm was applied to a parallel machine scheduling problem involving a molding production process in the wood industry. The algorithm was compared against four multiobjective techniques available in the literature: the multiobjective genetic algorithm (MOGA), the strength Pareto evolutionary algorithm (SPEA), the non-sorting genetic algorithm II (NSGA II), and multiobjective genetic local search (MOGLS). The proposed approach outperformed the benchmark techniques in most of the test problems based on two objectives of industrial interest: minimization of the maximum completion time (Cmax) and minimization of total tardiness. These objectives are directly related to the productivity of the product and the ability to deliver goods on time.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据