4.5 Article

An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors - A case study

期刊

COMPUTERS & OPERATIONS RESEARCH
卷 114, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2019.104812

关键词

Hybrid flowshop; NP-hard; Makespan; Flow time; Particle swarm optimization; Variable neighbourhood search

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

This paper addresses the multi-stage hybrid flowshop scheduling problem with identical parallel machines at each stage by considering the effect of human factors. The various levels of labours and the effects of their learning and forgetting are studied. The minimization of the weighted sum of the makespan and total flow time is the objective function. Since the problem is NP-hard, an improved version of the particle swarm optimization (PSO) algorithm is presented to solve the problem. A dispatching rule and a constructive heuristic are incorporated to improve the initial solutions of the PSO algorithm. The variable neighbourhood search (VNS) algorithm is also hybridized with the PSO algorithm to attain the optimal solutions consuming less computational time. An industrial scheduling problem of an automobile manufacturing unit is discussed. Moreover, several instances of the random benchmark problem are used to validate the performance of the proposed algorithm. Computational experiments have been performed and the results prove the effectiveness of the proposed approach. (C) 2019 Elsevier Ltd. All rights reserved.

作者

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

评论

主要评分

4.5
评分不足

次要评分

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

推荐

暂无数据
暂无数据