Optimization of Flow Shop Scheduling Problem using Tabu Search Algorithm: A Case Study

Archives of Foundry Engineering

“…The process of determining the energy consumption will be determined during each iteration. In order to fully describe the algorithm for this solution, the following should be defined: initial scheduling, traffic, final condition and the length of the prohibition for given traffic [13]. In a given study, due to the lack of information on the optimal method of selecting the initial solution, the algorithm will be performed for two different initial orderings.…”

“…In the first case, the tasks are ranked in ascending order of energy consumption, and in the second case, in descending order. The move will be to bring the selected item to the top of the list and move it the remaining elements to the empty space in the order [13]. The final condition is that the maximum number of iterations, which is the product of the number of tasks and the number of stations, has been exceeded.…”

“…The scheme of the algorithm's operation is shown in Figure 3, where the subsequent elements of the algorithm's operation include selecting the initial solution, searching for the best possible motion along with its execution, and checking the final condition. In addition, the diagram shows the elements that allow you to control the list of prohibited moves by adding more moves and reducing the forbidden time at the beginning of the loop, as well as controlling the improvement in subsequent moves to determine one of the conditions completion of the algorithm [13].…”