A linear programming mathematical model for slide-stainer scheduling problem with transportation

This paper mainly studies the Slide-Stainer scheduling problem considering transport time and continuous loading scenarios, a linear programming model suitable for this problem is proposed and a construction algorithm consists of four subroutines is used to solve the problem, the objective is to find the optimal feasible operation sequence, for the mechanical arm, on the Slide-Stainer to optimize the objective function. Firstly, this paper describes the Slide-Stainer scheduling problem and explains some characteristics of pathological slides, which are rarely mentioned in the previous literature. Secondly, A linear programming mathematical model for Slide-Stainer scheduling problem with transportation was proposed. Thirdly, the Y algorithm consists of four subroutines is proposed, and a feasible solution is obtained. Fourthly, the effectiveness of the algorithm is verified by the simulation of the actual staining da-ta, and the results meet the requirements. Finally, future research directions are described, such as multi-algorithm comparative optimization and multi-manipulator linkage transport modes.