1 R.Karthikeyan, 2 R.Rajkumar, 3 P.Immanuel
1 Assistant Professor, Department of Mechanical
Engineering, Einstein College of Engineering, Tirunelveli, Tamilnadu, India.
2 Professor, Department of Mechanical Engineering, Mepco Schlenk
Engineering College, Sivakasi, Tamil Nadu, India.
3 Assistant Professor, Department of Mechanical Engineering,
Einstein College of Engineering, Tirunelveli, Tamilnadu, India.
The objective of this paper
is to make a traditional process called scheduling much more finite and easy to
use in textile industry. In textile industry, complex equipments are to be used
precisely in such a way that the product being produced is completely finished
within the given time. Also, when dealing with fewer counts of yarns, the
process is quite easy to handle. But, if a huge sum of yarn counts are present
in the situation, the process becomes quite complex and leads to more
processing time. In order to reduce such complexity, time optimization, Tabu
search algorithm is used. Main problem is decomposed into independent sub
problems so that the algorithm can be parallelized on multiple processors. Each
sub problem is solved on a different processor. With the algorithm being
processed, corresponding programs are created with help of the programming
language JAVA. The output of the program are obtained and validated with actual
results.
