A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion

Abstract

In this paper we present a variable block insertion heuristic (VBIH) algorithm to solve the blocking flowshop scheduling problem with the total flowtime criterion. In the VBIH algorithm we define a minimum and a maximum block size. After constructing the initial sequence the VBIH algorithm starts with a minimum block size being equal to one. It removes the block from the current sequence and inserts it into the partial sequence sequentially with a predetermined move size. The sequence which is obtained after several block moves goes under a variable local search (VLS) which is based on traditional insertion and swap neighborhood structures. If the new sequence obtained after the VLS local search is better than the current sequence it replaces the current sequence. As long as it improves it keeps the same block size. However if it does not improve the block size is incremented by one and a simulated annealing-type of acceptance criterion is used to accept the current sequence. This process is repeated until the block size reaches at the maximum block size. Furthermore we present a novel constructive heuristic which is based on the profile fitting heuristic from the literature. The proposed constructive heuristic is able to further improve the best known solutions for some larger instances in a few seconds. Parameters of the constructive heuristic and the VBIH algorithm are determined through a design of experiment approach. Extensive computational results on the Taillard's well-known benchmark suite show that the proposed VBIH algorithm outperforms the discrete artificial bee colony algorithm which is one of the most efficient algorithms recently in the literature. Ultimately 52 out of the 150 best known solutions are further improved with substantial margins.