Scholarlink

The distributed permutation flowshop scheduling problem (DPFSP) has piqued the interest of researchers in recent years due to its applicability in real-world scenarios. In this paper, we address DPFSP to minimize total flowtime, which is a relevant and important criterion for dynamic manufacturing environment but not much discussed for this problem. Since, the DPFSP is known to be NP-hard, we focus on approximate approaches and propose two constructive heuristics based on different techniques. To evaluate the effectiveness of the proposed heuristics, we test them on a benchmark set of 720 large-sized instances. A comprehensive computational analysis shows that the proposed heuristics solve the problem in a reasonable computational time and perform significantly better than the best performing constructive heuristics from the literature.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Improved Constructive Heuristics to Minimize Total Flowtime in Distributed Permutation Flowshop Scheduling Problem

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Mohd Ayaz,
  • Musrrat Ali,
  • Millie Pant

摘要

The distributed permutation flowshop scheduling problem (DPFSP) has piqued the interest of researchers in recent years due to its applicability in real-world scenarios. In this paper, we address DPFSP to minimize total flowtime, which is a relevant and important criterion for dynamic manufacturing environment but not much discussed for this problem. Since, the DPFSP is known to be NP-hard, we focus on approximate approaches and propose two constructive heuristics based on different techniques. To evaluate the effectiveness of the proposed heuristics, we test them on a benchmark set of 720 large-sized instances. A comprehensive computational analysis shows that the proposed heuristics solve the problem in a reasonable computational time and perform significantly better than the best performing constructive heuristics from the literature.