a vibration damping optimization algorithm to solve flexible job shop scheduling problems with reverse flows

The flexible job shop scheduling problem (fjsp), as a production scheduling problem (psp), is generally an extension of the job shop scheduling problem (jsp). in this paper, the fjsp with reverse flow consisting of two flows of jobs (direct and reverse) at each stage is studied; the first flow initiates in stage 1 and goes to stage c (the last stage), and the second flow starts with stage c and ends up in stage 1. the aim is to minimize the makespan of the jobs (the maximum completion time). a mixed integer programming (mip) is presented to model the problem and the branch and bound (b&b) method is used to solve the problem. a numerical small-size problem is presented to demonstrate the applicability, for which the lingo16 software is employed for a solution. due to the np-hardness of the problem, a meta-heuristic, namely the vibration damping optimization (vdo) algorithm with tuned parameters using the taguchi method, is utilized to solve large-scale problems. to validate the results obtained using the proposed solution algorithm in terms of the solution quality and the required computational time, they are compared with those obtained by the lingo 16 software for small-size problems. finally, the performance of the proposed algorithm is compared with a genetic algorithm (ga) by solving some randomly generated larger-size test problems, based on which the results are analyzed statistically. computational results confirm the efficiency and effectiveness of the proposed algorithm and show that the vdo algorithm performs well.