4.7 Article

Coordinated scheduling of production and transportation in a two-stage assembly flowshop

期刊

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 54, 期 22, 页码 6891-6911

出版社

TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2016.1193246

关键词

scheduling; assembly flowshop; genetic algorithms; variable neighbourhood search; opposition-based learning

资金

  1. National Natural Science Foundation of China [71231007, 71131004, 71301124, 51305376]
  2. Research Fund for the Doctoral Program of Higher Education of China [20130141120071]

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

To enhance the overall performance of supply chains, coordination among production and distribution stages has recently received an increasing interest. This paper considers the coordinated scheduling of production and transportation in a two-stage assembly flowshop environment. In this problem, product components are first produced and assembled in a two-stage assembly flowshop, and then completed final products are delivered to a customer in batches. Considering the NP-hard nature of this scheduling problem, two fast heuristics (SPT-based heuristic and LPT-based heuristic) and a new hybrid meta-heuristic (HGA-OVNS) are presented to minimise the weighted sum of average arrival time at the customer and total delivery cost. To guide the search process to more promising areas, the proposed HGA-OVNS integrates genetic algorithm with variable neighbourhood search (VNS) to generate the offspring individuals. Furthermore, to enhance the effectiveness of VNS, the opposition-based learning (OBL) is applied to establish some novel opposite neighbourhood structures. The proposed algorithms are validated on a set of randomly generated instances, and the computation results indicate the superiority of HGA-OVNS in quality of solutions.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据