Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time

Release time:2024-08-09  Hits:

• Affiliation of Author(s):信息与控制工程学院
• Journal:European Journal of Operational Research
• Key Words:中文关键字：调度；混合装配-分化流水车间；混合元启发式算法；总流经时间，英文关键字：Scheduling; Hybrid assembly-differentiation flowsh
• Abstract:This study considers a hybrid assembly-differentiation flowshop scheduling problem (HADFSP), in which there are three production stages, including components manufacturing, assembly, and differentiation. All the components of a job are processed on different machines at the first stage. Subsequently, they are assembled together on a common single machine at the second stage. At the third stage, each job of a particular type is processed on a dedicated machine. The objective is to find a job schedule to minimize total flow time (TFT). At first, a mixed integer programming (MIP) model is formulated and then some properties of the optimal solution are presented. Since the NP-hardness of the problem, two fast heuristics (SPT-based heuristic and NEH-based heuristic) and three hybrid meta-heuristics (HGA-VNS, HDDE-VNS and HEDA-VNS) are developed for solving medium- and large-size problems. In order to evaluate the performances of the proposed algorithms, a lower bound for the HADFSP with TFT criteria (HADFSP-TFT) is established. The MIP model and the proposed algorithms are compared on randomly generated problems. Computational results show the effectiveness of the MIP model and the proposed algorithms. The computational analysis indicates that, in average, the HDDE-VNS performs better and more robustly than the other two meta-heuristics, whereas the NEH heuristic consume little time and could reach reasonable solutions.
• Note:熊福力
• Co-author:王峰
• First Author:xiongfuli
• Indexed by:Journal paper
• Correspondence Author:邢科义
• Volume:卷：240
• Issue:期：2
• Page Number:页：338-354
• Translation or Not:no
• Date of Publication:2015-01-01