An efficient heuristic algorithm for flow shop scheduling problem with periodic machine specific halting and preventive maintenance operations

In the majority of flow shop scheduling scenarios, machine availability is typically assumed consistent throughout the process. Allowing machines to operate continually without a break, however, results decline in productivity or machine failure. Therefore, it is required to allow machines to undergo maintenance operations periodically including halts to avoid machine breakdowns as well as improve performance factors like productivity, reliability and affordability. The existing literature lacks comprehensive studies on flow shop scheduling models integrated with halting times and preventive maintenance operations. Given the practical relevance of this gap, this paper first address a flow shop scheduling problem (FSSP) with periodic machine-specific halting and preventive maintenance operations. To minimise the overall tardiness and effectively manage halting and preventive maintenance operations with job scheduling, an effective NEH-based heuristic algorithm has been developed. As the present problem is new to the literature, comparative studies are not carried out. However, over 50 Taillard benchmark instances ranging from 20-jobs five-machines to 200-jobs ten-machines are used to test the performance of the proposed technique and results are duly reported, which could be helpful as a comparative basis for further research. The results reveal that the proposed algorithm provides the best solutions within a considerable time.