Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation
研究了装配流水车间调度问题，提出一种可应用于插入式方法的加速过程，并设计了四种基于Johnson算法和NEH启发式的构造性启发式算法，与47种现有算法对比，表现优异。
In this paper, we address the assembly flowshop scheduling problem, which is a generalisation of two well-known scheduling problems in the literature: the three-stage Assembly Scheduling Problem (ASP) and its variant with two stages denoted as the two-stage ASP. For this problem, we prove several theoretical results which are used to propose a speed-up procedure. This acceleration mechanism can be applied in any insertion-based method for the problem under study and, consequently, also for their special cases. In addition, we propose four efficient constructive heuristics for the problem, based on both Johnson’s algorithm and the NEH heuristic. These proposals are compared against 47 algorithms existing in the literature for related problems. The results show the excellent performance of the proposals.