期刊
ENGINEERING OPTIMIZATION
卷 51, 期 2, 页码 185-198出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/0305215X.2018.1444163
关键词
Scheduling; no-idle flowshop; heuristics; total flowtime
资金
- Brazilian National Research Council (CNPq) [448161/2014-1, 308047/2014-1, 306075/2017-2]
In this article, the issue of production scheduling in a no-idle flowshop environment is addressed. An extensive literature review has shown that there are no heuristics specifically proposed for this problem, especially when it comes to constructive heuristic methods. In this context, this article proposes a highly efficient simple constructive heuristic to minimize the total flowtime criterion. The proposed heuristic was embedded in the high performance iterated greedy algorithm. Computational results and statistical analysis show that the proposed heuristic overperformed the main constructive methods found up to now. In addition, it is observed that the integration of the proposed heuristic with the iterated greedy algorithm provides the most efficient metaheuristic for the problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据