A two-stage assembly flow-shop scheduling problem with bi-level products structure and machines' availability constraints

This paper incorporates the preventive maintenance activities into the two-stage assembly flow-shop scheduling problem, which has m machines at the production stage and an assembly machine at the second one. In this paper, three maintenance policies are employed based on the maximization of machine's reliability and availability. This problem is NP-hard. So, two hybrid optimization methods, namely variable neighborhood search together with simulated annealing algorithm, and variable neighborhood search along with tabu search algorithm, are used to find the proper job sequencing. Statistical methods are conducted based on the hypothetical testing and analysis of variance to determine the better solution method and sensitivity analysis. Also, the performances of the presented algorithms on the problems of different sizes are analyzed. Results have shown that variable neighborhood search with simulated annealing outperforms another algorithm in the quality of solutions and computational time.

Automated summary

This paper incorporates preventive maintenance activities into the two-stage assembly flow-shop scheduling problem and proposes three maintenance policies. Two hybrid optimization methods are used to find proper job sequencing, with variable neighborhood search with simulated annealing algorithm showing superior solution quality and computational time.