0% found this document useful (0 votes)
34 views7 pages

Application of Tabu Search, TS, To Solve A Flow Shop Scheduling Problem With Changeover Times in Operations: A Case Study

Flow Shop Scheduling (FSS) Problems are NP-hard combinatorial optimization problems. It is quite difficult to achieve an optimal solution for FSS problems with mathematical modelling approaches because of its NP-hard structure. Tabu search (TS), a mega-heuristic algorithm, plays a major role in searching for near-optimal solutions for NP-hard optimization problems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views7 pages

Application of Tabu Search, TS, To Solve A Flow Shop Scheduling Problem With Changeover Times in Operations: A Case Study

Flow Shop Scheduling (FSS) Problems are NP-hard combinatorial optimization problems. It is quite difficult to achieve an optimal solution for FSS problems with mathematical modelling approaches because of its NP-hard structure. Tabu search (TS), a mega-heuristic algorithm, plays a major role in searching for near-optimal solutions for NP-hard optimization problems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

BOHR International Journal of Operations Management Research

and Practices
2024, Vol. 3, No. 1, pp. 1–7
DOI: 10.54646/bijomrp.2024.22
www.bohrpub.com

CASE STUDY

Application of tabu search, TS, to solve a flow shop


scheduling problem with changeover times in operations:
A case study
Phong Nguyen Nhu * and Thuy Nhi Nguyen Thi
HCMC University of Technology, VNU HCM, Ho Chi Minh City, Vietnam

*Correspondence:
Phong Nguyen Nhu,
[email protected]

Received: 12 October 2023; Accepted: 19 October 2023; Published: 05 January 2024

Flow Shop Scheduling (FSS) Problems are NP-hard combinatorial optimization problems. It is quite difficult to
achieve an optimal solution for FSS problems with mathematical modeling approaches because of its NP-hard
structure. Tabu search (TS), a mega-heuristic algorithm, plays a major role in searching for near-optimal solutions
for NP-hard optimization problems. This paper develops a TS model for solving a FSS problem with the objective
to reduce total weighted tardiness time, and constraint on changeover time in operations. The performance of
the TS model is compared with that of traditional EDD heuristics, being used. The result shows that the objective
value has been reduced by 43%, from 215.95 to 123.07 (h). It indicates that the TS model is a good approach for
FSS problems.
Keywords: flow shop scheduling problems, tardiness time, changeover times, tabu search, mega heuristic.

Introduction the solution of the currently used heuristic model to evaluate


the effectiveness of the TS model.
Scheduling is the allocation of resources to perform a
collection of tasks over a period of time. Scheduling problems
determine the order or sequence for processing a set of
Literature review and research
jobs through several machines in an optimal manner. FSS methodology
problems consider m different machines and n jobs; each
job consists of m operations and each operation requires a Flow shop scheduling FSS problems
different machine and all the jobs are processed in the same
processing order. Flow shop scheduling problems consider different
machines and different jobs. Each job consists of different
The problem to be solved is a FSS problem with the
operations and each operation requires a different machine
assumption that the orders are ready at the start of
and all the jobs are processed in the same processing
the scheduling process. The objective of the problem is
order (1).
to minimize the total weighted tardiness of orders. The Flow shop scheduling is categorized as an NP-hard
constraints are on the sequence of orders, on the sequence of problem, so it is difficult to develop algorithms to
operations in the orders, and on machine changeover time. solve it (2). Jatinder N. D. Gupta, Nagarajan Palanim
The model of the problem is built based on the above Uthu, and Chuen-Lung Chen designed a tabu search-
assumptions, objectives, and constraints. A TS model is built. based heuristic for the two-stage flow shop problem with
Based on the model of the problem, the TS model will find a the makespan minimization as the primary criterion and
good solution for the problem, which will be compared with the minimization of total flow time as the secondary

1
2 Nhu and Thi

criterion (3). Moch Saiful Umam, Mustafid Mustafid, Research methodology


and Suryono Suryono combined the tabu search process
with a genetic algorithm to solve flow shop scheduling FSS problem is a NP hard problem with a large size of
problem with the objective of minimizing makespan (2). solution space. The methodology, used in this research to
Anna Burduk, Kamil Musiał, Joanna Kochańska, Dagmara solve the problem, includes 2 phases (1):
Górnicka, and Anastasia Stetsenko applied tabu Search and
genetic algorithm to solve production process scheduling - Phase A: Construct the model of the problem.
problems and found that intelligent methods can find, - Phase B: Use TS model to solve the problem.
in relatively short time, the solution that is close to
In phase A, the model of the problem is formulated with
the optimal and acceptable from the problem point
the objective of minimizing the total weighted tardiness time
of view (4).
and constraint on operation changeover time.
Based on the model of the problem, a TS model is used
to solve the problem in phase B. The TS procedure (1) is as
Tabu search
follows:
Step 1: Initialize the TS model.
According to Farhad Kolahan et al. (5), heuristic algorithms
Step 2: Generate the initial solution S0 . Set k = 0.
are widely used to solve very large and complicated
Step 3: Generate the neighborhood population PN (k).
optimization problems, in recent years, and Tabu Search (TS)
Step 4: Find the next solution Sk+1 . Set k = k + 1,
is one of the most efficient neighborhood search algorithms.
Step 5: Check the termination rule. If No, return to step 3.
Tabu search (TS), suggested by Glover and Laguna in 1997,
If Yes, finish the loop.
is one of the most popular meta-heuristics to find solutions
Step 1 initializes the TS model by setting up the structure
of various combinatorial optimization problems. TS guides a
and parameters of the TS model, including the method of
local search procedure to explore the solution space beyond
coding, the TS factors, and the termination rule.
local optimality.
For coding, the orders are numbered from 1 to n (n
In order to apply TS to a problem, generally the solution
is the total number of orders), each code is a string of
space of the problem is represented by a population
n numbers. Each number corresponds to an order. The
of codes. An evaluation value is associated with each
sequence of numbers Gi, i = 1÷n, represents the sequence
code. The evaluation function is a measure of the extent
of orders scheduled.
to which the objective of the problem is achieved.
The Fbest value is the best evaluation value, found C = [G1, G2, . . . , Gn]
during the search.
TS allows intelligent problem solving by the incorporation The TS factors include the evaluation function, the current
of adaptive memory and responsive exploration. Key best value, the TS operators, and the tabu list. The evaluation
elements of the search path are selectively remembered and function is defined according to the objective function of
strategic choices are made to guide the search out of local the problem, is used to evaluate scheduling codes. The
optima and into diverse regions. current best value Tbest is the best objective value, updated
However, considering every possible move from the after each iteration.
current solution may be extremely time consuming and The TS operators include the neighborhood and search
computationally expensive. In order to avoid cycling and operators. Tabu list is defined by tabu members and tabu list
becoming trapped in local optima, certain moves that lead size. Tabu members are moves in the previous loops. Tabu
to previously explored regions are forbidden. Attributes of list size is a parameter of the algorithm. Tabu list is updated
recently visited solutions are set to be tabu for a certain after each iteration.
number of iterations, and these moves are stored in the The termination rule in this research: The best objective
tabu list. Elements of tabu list define all tabu moves that value Tbest does not improve after a specific number of
cannot be applied to the current solution. The size of consecutive iterations.
tabu list is bounded by a parameter. The tabu status of a Step 2 generates the initial solution S0. A good initial
move may be canceled, making it an allowable move if an solution will be a good starting point for the search. The
aspiration criterion is satisfied. A tabu move can always be initial solution is often chosen by heuristic methods, SPT,
allowed to be chosen if it creates a solution better than the LPT, EDD. In this research, the initial solution is generated by
incumbent best solution. the best heuristic method that gives the best objective value.
A typical TS implementation starts from an initial solution This steps also starts the algorithm by setting the iteration
and moves from the current solution to the best one counting index k to 0.
among its neighborhoods at each iteration, even if this new Step 3 uses neighborhood operator to generate the
solution is worse than the one available, until a pre-specified neighborhood population PN (k) from the current string Sk .
termination rule becomes true. This research uses SWAP as the neighborhood operator.
10.54646/bijomrp.2024.22 3

SWAP uses the method of permutation of adjacent numbers The model is set up with variables TSij being the start time,
in the string to find the neighborhood. For a string with n TEij being the completion time of order i at operation j, and
numbers, SWAP will generate n-1 neighboring strings. Ti being the tardiness time of order i. The constraints on the
Step 4 finds the next solution Sk+1 from the neighborhood sequence of operation on each order are as follows.
population PN (k) by using the search operator. The search
operator relies on the objective function and the tabu list to TSi4 ≥ TEi1 ,
find the best solution in the neighborhood region, the chosen TSi5 ≥ TEi2 ,
solution must not violate the tabu list. This solution will be TSi6 ≥ TEi3 ,
selected for the next iteration, if any. This step also updates
TSi7 ≥ TEi5 ,
the tabu list and the current best Tbest if the objective value
of the solution is better than the current Tbest. This step also TSi8 ≥ max(TEi4 , TEi6 , TEi7 ).
increases the iteration counting index k by 1 to prepare for
the next iteration, if any. The start time of order i at operation j, TSij depends on the
Step 5 checks the termination rule. The algorithm usually end time of the previous order i’, TEi0 j and the changeover
terminates after a number of iterations if the objective time between the orders on operation j.
function is not improved. If the termination rule is not met,
TSij = TCi0 j + Sj
the algorithm returns to step 3 for the next iteration. If the
termination rule is met, the iteration loop is stopped. The end time of order i on operation j, TEij , is determined
The research methodology of the TS model is shown in the by the start time and processing time of the order.
following sections.
TCij = TSij + Pij

The model flow shop scheduling The tardiness time of order i, Ti , is determined by the end
time in the last operation and due time of the order.
problem
Ti = Max (0, TEi8 − Di )
The problem to be solved is a FSS problem (1) with 10 orders,
Oi , i = 1÷10, scheduling on 4 machines, M1 , M2 , M3 , M4 .
Each order has 3 parts, P1, P2, P3, processed in 8 operations, TABLE 2 | The processing time Pij of order i, i = 1÷10, on operation j.
Oj , j = 1÷8, distributed on the 4 machines as in Figure 1.
j P1j P2j P3j P4j P5j P6j P7j P8j P9j P10j
The weight Wi , i = 1÷10, and the due date Di , i = 1÷10, of
order i are estimated in Table 1. 1 2.34 6.17 6.20 7.09 2.47 9.56 3.44 14.74 5.26 1.39
The processing time Pij of order i, i = 1÷10, on operation 2 2.25 0.94 7.05 3.22 1.07 5.26 1.81 7.49 5.26 0.66
j, j = 1÷8, are estimated in Table 2. 3 0.00 3.99 4.34 4.38 2.60 9.52 0.00 16.75 14.74 0.44
The changeover times in hours on operation j, j = 4÷8 are 4 2.63 1.33 1.08 9.00 2.60 12.56 1.32 17.54 16.52 1.29
equal to 0, Sj = 0, j = 4÷8. The changeover times in hours on 5 1.06 1.00 6.58 9.00 4.21 12.64 0.65 17.54 16.52 1.29
operation j, j = 1÷3 are the same and depend on the current 6 0.00 8.33 6.58 3.60 3.95 12.64 0.00 13.33 15.79 0.40
order i = 1÷10, and the next order, i’ = 1÷10, as shown in 7 2.67 3.29 1.13 2.21 0.68 4.00 1.11 5.26 1.60 0.44
Table 3. 8 4.08 3.31 3.42 12.00 3.95 6.12 2.21 8.22 5.26 1.32

TABLE 3 | Changeover time (h) Sj , j = 1÷3.

1 2 3 4 5 6 7 8 9 10

1 0.0 0.5 2.0 0.0 0.0 2.0 2.0 2.0 2.0 2.0
2 0.5 0.0 0.0 0.0 2.0 2.0 2.0 2.0 2.0 2.0
FIGURE 1 | The production process.
3 2.0 0.0 0.0 2.0 0.5 2.0 0.5 0.5 2.0 0.5
4 0.0 0.0 2.0 0.0 0.0 0.0 2.0 2.0 2.0 2.0
TABLE 1 | The weight Wi , i = 1÷10, and the due date Di , i = 1÷10, of 5 0.0 2.0 0.5 0.0 0.0 2.0 0.5 2.0 0.5 0.5
order i. 6 2.0 2.0 2.0 0.0 2.0 0.0 0.5 2.0 0.0 0.0
7 2.0 2.0 0.5 2.0 0.5 0.5 0.0 0.5 2.0 0.0
i 1 2 3 4 5 6 7 8 9 10
8 2.0 2.0 0.5 2.0 2.0 2.0 0.5 0.0 0.0 0.0
Wi 3.70 3.40 3.30 4.65 3.90 2.35 2.70 4.55 4.65 4.30 9 2.0 2.0 2.0 2.0 0.5 0.0 2.0 0.0 0.0 2.0
Di (h) 24 36 40 60 68 80 88 88 96 96 10 2.0 2.0 0.5 2.0 0.5 0.0 0.0 0.0 2.0 0.0
4 Nhu and Thi

FIGURE 2 | The Gantt Chart by EDD dispatching method.

The objective function that minimizes the total tardiness is Step 2: Generate the initial solution S0 , set k = 0
defined as follows. A good initial solution will be a good starting point for the
search. With the objective of minimizing tardiness time, the
Tbest = MinT, T = 6(W∗i Ti , i = 1 ÷ 11) initial solution is selected from the EDD method. The strings
and its corresponding objective values are as follows.
The company is currently using the EDD dispatching
method. The sequence of dispatching S and the value of the S0 = (1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
objective function are as follows: T = 215.95(h)
S = (1, 2, 3, 4, 5, 6, 7, 8, 9, 10); The initial tabu list TL and the current best
T = 215.95 (h) value are as follows.

The Gantt Chart is as in Figure 2. TL = ∅


Tbest = 215.95 (h)
From the initial solution S0 , iteration 1 is executed with
The TS model for the flow shop steps 3, 4, and 5.
scheduling problem Iteration 1
Step 3: Generate the neighborhood population PN (0)
The above FSS problem is a NP hard problem with the size of This step uses the neighborhood operator SWAP to
the solution space of 10! or 3,628,800. The above TS model is generate the neighborhood population PN (0) from the
used to solve the problem with following steps. current string S0 .
Step 1: Initialize the TS model
This step sets up the method of coding, the TS factors, and PN (0) = {N1, N2, N3, N4, N5, N6, N7, N8, N9}
the termination rule. The strings in neighborhood population PN (0) and their
The method of coding: The orders are numbered from 1 objective values are shown in Table 5.
to 10. Each code is a string of 10 numbers. Each number
corresponds to an order. The sequence of numbers Gi ,
i = 1÷10 represents the sequence of order scheduled. TABLE 4 | The TS factors.
For example, the string of EDD scheduling method is Factors Values
as follows.
The evaluation function The objective function T
C = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] The current best value Tbest The best objective value
Neighborhood operator SWAP
The TS factors include the evaluation function, the
Neighborhood region size 9
current best value, the parameters of the TS operators, and
Tabu members 2 swap numbers in the
the Tabu List as shown in Table 4. previous chosen string
The termination rule: The best objective value Tbest does Tabu list size 5
not improve after 10 consecutive iterations.
10.54646/bijomrp.2024.22 5

TABLE 5 | The neighborhood population PN (0) . Step 4. Find the next solution S2
This step uses the search operator to find the next solution
String G1 G2 G3 G4 G5 G6 G7 G8 G9 G10 Ti
S2 that is the best solution in the neighborhood population
S0 1 2 3 4 5 6 7 8 9 10 215.95 PN (1) , and does not violate the current tabu list. The
N1 2 1 3 4 5 6 7 8 9 10 264.75 strings in the neighborhood population PN (1), and their
N2 1 3 2 4 5 6 7 8 9 10 203.75 corresponding tabu members TM are shown in Table 8.
N3 1 2 4 3 5 6 7 8 9 10 242.49 From Table 8, string N9 in PN (1) violates tabu list. The best
N4 1 2 3 5 4 6 7 8 9 10 175.90 string in the neighboring population PN (1) without violating
N5 1 2 3 4 6 5 7 8 9 10 241.39
N6 1 2 3 4 5 7 6 8 9 10 221.26
N7 1 2 3 4 5 6 8 7 9 10 224.11 TABLE 6 | Find the next solution S1.
N8 1 2 3 4 5 6 7 9 8 10 239.71
N9 1 2 3 4 5 6 7 8 10 9 175.65 String G1 G2 G3 G4 G5 G6 G7 G8 G9 G10 Ti TM

N1 2 1 3 4 5 6 7 8 9 10 264.75 (1,2)
N2 1 3 2 4 5 6 7 8 9 10 203.75 (2,3)
Step 4. Find the next solution S1 N3 1 2 4 3 5 6 7 8 9 10 242.49 (3,4)
This step uses the search operator to find the next N4 1 2 3 5 4 6 7 8 9 10 175.90 (4,5)
solution S1 that is the best solution in the neighborhood N5 1 2 3 4 6 5 7 8 9 10 241.39 (5,6)
population PN (0) , and does not violate the current tabu N6 1 2 3 4 5 7 6 8 9 10 221.26 (6,7)
list. The strings in the neighborhood population PN (0), N7 1 2 3 4 5 6 8 7 9 10 224.11 (7,8)
and their corresponding tabu members TM are shown N8 1 2 3 4 5 6 7 9 8 10 239.71 (8,9)
in Table 6. N9 1 2 3 4 5 6 7 8 10 9 175.65 (9, 10)
From Table 6, the best string in the neighboring
population PN (0) without violating tabu list and its objective
value are as follows.
TABLE 7 | The neighborhood population PN (1) .
N9 = (1, 2, 3, 4, 5, 6, 7, 8, 10, 9)
String G1 G2 G3 G4 G5 G6 G7 G8 G9 G10 Ti
T = 175.65 (h)
S1 1 2 3 4 5 6 7 8 10 9 175.65
This string is selected as the next solution for the next N1 2 1 3 4 5 6 7 8 10 9 224.45
iteration, if any. N2 1 3 2 4 5 6 7 8 10 9 163.45
N3 1 2 4 3 5 6 7 8 10 9 202.19
S1 = (1, 2, 3, 4, 5, 6, 7, 8, 10, 9) N4 1 2 3 5 4 6 7 8 10 9 135.60
N5 1 2 3 4 6 5 7 8 10 9 201.09
The tabu list and the current best Tbest are
N6 1 2 3 4 5 7 6 8 10 9 180.96
updated as follows.
N7 1 2 3 4 5 6 8 7 10 9 187.61
TL = {(9, 10)} N8 1 2 3 4 5 6 7 8 10 9 177.58
N9 1 2 3 4 5 6 7 8 9 10 215.95
Tbest = 175.65 (h).

Step 5. Check the termination rule


After iteration 1, S1 is the best string with the best objective TABLE 8 | Find the next solution S2.
value of 175.65, appearing only once. The termination rule is
not satisfied, so iteration 2 is executed. String G1 G2 G3 G4 G5 G6 G7 G8 G9 G10 Ti TM

Iteration 2 S1 1 2 3 4 5 6 7 8 10 9 175.65 -
Step 3: Generate the neighborhood population PN (1) N1 2 1 3 4 5 6 7 8 10 9 224.45 (1,2)
This step uses the neighborhood operator SWAP to N2 1 3 2 4 5 6 7 8 10 9 163.45 (2,3)
generate the neighborhood population PN (1) from the N3 1 2 4 3 5 6 7 8 10 9 202.19 (3,4)
current string S1 . N4 1 2 3 5 4 6 7 8 10 9 135.60 (4,5)
N5 1 2 3 4 6 5 7 8 10 9 201.09 (5,6)
N6 1 2 3 4 5 7 6 8 10 9 180.96 (6,7)
PN (1) = {N1, N2, N3, N4, N5, N6, N7, N8, N9} N7 1 2 3 4 5 6 8 7 10 9 187.61 (7,8)
N8 1 2 3 4 5 6 7 10 8 9 177.58 (8,10)
The strings in neighborhood population PN (1) and their N9 1 2 3 4 5 6 7 8 9 10 215.95 (10,9)
objective values are shown in Table 7.
6 Nhu and Thi

tabu list and its objective value are as follows. TABLE 10 | Find the next solution S3.

String G1 G2 G3 G4 G5 G6 G7 G8 G9 G10 Ti Tabu


N4 = (1, 2, 3, 5, 4, 6, 7, 8, 10, 9)
T = 135.60 (h) N1 2 1 3 5 4 6 7 8 10 9 171.90 (1,2)
N2 1 3 2 5 4 6 7 8 10 9 190.71 (2,3)
This string is selected as the next solution for the next N3 1 2 5 3 5 6 7 8 10 9 211.21 (3,5)
iteration, if any. N4 1 2 3 4 5 6 7 8 10 9 175.65 (5,4)
N5 1 2 3 5 6 4 7 8 10 9 304.22 (4,6)
S2 = N4 = (1, 2, 3, 5, 4, 6, 7, 8, 10, 9) N6 1 2 3 5 4 7 6 8 10 9 167.45 (6,7)
N7 1 2 3 5 4 6 8 7 10 9 149.12 (7,8)
The tabu list is updated as follows.
N8 1 2 3 5 4 6 7 10 8 9 149.39 (8,10)
N9 1 2 3 5 4 6 7 8 9 10 175.90 (10,9)
TL = {(9, 10), (4, 5)}

The objective value of the best string in this iteration


is 135.60, smaller than the current best value, so Tbest is TABLE 11 | The result after 27 iterations.
updated as follows. Iteration G1 G2 G3 G4 G5 G6 G7 G8 G9 G10 T Tbest

Tbest = 135.60 (h) 0 1 2 3 4 5 6 7 8 9 10 215.95 215.95


1 1 2 3 4 5 6 7 8 10 9 175.65 175.65
Step 5. Check the termination rule 2 1 2 3 5 4 6 7 8 10 9 135.60 135.60
After iteration 2, S2 is the best string with the best objective 3 1 2 3 5 4 6 8 7 10 9 149.12 135.60
value of 135.60, appearing only once. The termination rule is ...
not satisfied, so iteration 3 is executed. 17 1 3 2 4 5 10 8 7 9 6 123.07 123.07
Iteration 3 ...
Step 3: Generate the neighborhood population PN (2) 27 2 1 3 5 4 7 8 10 9 6 163.36 123.07
This step uses the neighborhood operator SWAP to
generate the neighborhood population PN (2) from the
current string S2 . From Table 10, strings N4, and N9 in PN (2) violate the
tabu list. The best string in the neighboring population
PN (2) = {N1, N2, N3, N4, N5, N6, N7, N8, N9} PN (2) without violating the tabu list and its objective
value are as follows.
The strings in neighborhood population PN (2) and their
objective values are shown in Table 9. N7 = (1, 2, 3, 5, 4, 6, 8, 7, 10, 9)
Step 4. Find the next solution S3 T = 149.12 (h)
This step uses the search operator to find the next solution
S3 that is the best solution in the neighborhood population This string is selected as the next solution for the next
PN (2) , and does not violate the current tabu list. The iteration, if any.
strings in the neighborhood population PN (2), and their
corresponding tabu member are shown in Table 10. S3 = N7 = (1, 2, 3, 5, 4, 6, 8, 7, 10, 9)

The tabu list is updated as follows.


TABLE 9 | The neighborhood population PN (1) .
TL = {(9, 10), (4, 5), (7, 8)}
String G1 G2 G3 G4 G5 G6 G7 G8 G9 G10 Ti
The objective value of the best string in this iteration is
S2 1 2 3 5 4 6 7 8 10 9 135.60 149.12 bigger than the current best value 135.60, then Tbest
N1 2 1 3 5 4 6 7 8 10 9 171.90 remains the same.
N2 1 3 2 5 4 6 7 8 10 9 190.71
N3 1 2 5 3 5 6 7 8 10 9 211.21 Tbest = 135.60 (h).
N4 1 2 3 4 5 6 7 8 10 9 175.65
N5 1 2 3 5 6 4 7 8 10 9 304.22
Step 5. Check the termination rule
N6 1 2 3 5 4 7 6 8 10 9 167.45
After iteration 3, S3 is the best string in PN (2) with the
N7 1 2 3 5 4 6 8 7 10 9 149.12
objective value of 149.12, but S2 is still the best string with
N8 1 2 3 5 4 6 7 8 10 9 149.39
the best objective value of 135.60, appearing only twice. The
N9 1 2 3 5 4 6 7 8 9 10 175.90
termination rule is not satisfied, so iteration 4 is executed.
The result after 27 iterations is as in Table 11.
10.54646/bijomrp.2024.22 7

The best objective value Tbest remains the same from the Moreover, TS is a local search method, if it combines with
17th iteration to the 27th iteration, the termination rule is another global search method like Genetic Algorithm, the
satisfied, the algorithm ends. The best scheduling string and result would be better in terms of quality, better objective
its objective value are as follows. value, and cost, smaller number of iterations.

S = (1, 3, 2, 4, 5, 10, 8, 7, 9, 6),


T = 123.07 (h) Author contributions
The objective value according to TS model (123.07 h) is Both authors have made a substantial, direct, and intellectual
better than the objective value according to the EDD heuristic contribution to the work, and approved it for publication.
currently used (215.95 h).

References
Conclusion
1. Nhu PN, Nhi T, Thi N. Application of TSGA, a hybrid mega heuristic
The Flow Shop Scheduling Problem with 10 orders on model, to solve flow shop scheduling problems with changeover times in
4 machines has been formulated with the objective of operations. A case study. Proceeding of the 4 th International Conference
on Advanced Convergence Engineering (ICACE 2023) August 14th – 16th,
minimizing the total weighted tardiness time and constraint 2023, Ho Chi Minh City University of Technology, VNUHCM, Ho Chi
on changeover time in operations. The TS model has been Minh City: (2023).
developed and used to solve the problem. The results show 2. Umam MS, Mustafid M, Suryono S. A hybrid genetic algorithm and Tabu
that the TS model is better than the heuristic EDD method search for minimizing makespan in flow shop scheduling problem. J King
Saud Univ Comp Inf Sci. (2022) 34:7459–67.
being used. The objective value has reduced by 43% from
3. Gupta JND. Designing a tabu search algorithm for the two-stage flow
215.95 (h) to 123.07 (h).
shop problem with secondary criterion. Prod Plann Cont Manage Oper.
However, the factors of the model, including the method (1999) 10:251–65. doi: 10.1080/095372899233217
for defining the initial solution, factors of neighborhood 4. Burduk A, Musiał K, Kochańska J, Górnicka D, Stetsenko A. Tabu
operator, search operator, tabu list size, the method and Search and genetic algorithm for production process scheduling problem.
parameter of the termination rule, are only selected LogForum. (2019) 15:181–9. doi: 10.17270/J.LOG.2019.315
empirically, so the results are not very good. Future research 5. Kolahan F, Tavakoli A, Tajdin B, Hosayni M. Analysis of neighborhood
generation and move selection strategies on the performance of Tabu
is to use experimental design DOE to determine the model Search. Proceedings of the 6th WSEAS International Conference on Applied
factors to get better results. Further research is to use the Computer Science, Tenerife, Canary Islands, Spain, December 16-18,
model for larger numbers of orders. Tenerife (2006). p. 503–7.

You might also like