Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation
Victor Fernández-Viagas, Carla Talens, José M. Framiñán
Abstract
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.