PENERAPAN ALGORITMA TABU SEARCH PADA PERMASALAHAN LINTASAN KESEIMBANGAN BENTUK U TIPE I DENGAN WAKTU PROSES STOKASTIK

Hotma Marina Sitorus, Cynthia P. Sitorus, Pauline Ciputra

Abstract


This paper describes the application of Tabu Search to solve a U-shaped line balancing problem which seeks to obtain the minimum cycle time using the number of workers available (type I line balancing problem). To accommodate the differences between operators, this paper uses stochastic processing times. The performance of the proposed algorithm is analysed using various hypothetical cases. The cases are different in terms of the complexity of presedensi structure, the desired cycle times, and the standard deviation of processing times. This paper also studies the impact of the Tabu Search parameters on the performance of the proposed algorithm. Experimental results show that the proposed algorithm is superior to Maximum Ranked Positional Weight method in all the cases and to Ant Colony System-based algorithm in several cases. This paper also finds that in several cases, the performance of the proposed algorithm is not influenced by the parameters of Tabu Search.


Full Text:

PDF

Refbacks

  • There are currently no refbacks.