Implementation of Tabu Search Algorithm in Multi-Skilled Labor Scheduling for Assignment Problems

Abstract

This study discusses the multi-skilled labor scheduling to accomplish all tasks where each labor has different skill to complete tasks than other labors. This case is known as the assignment problem. The objective value is to minimize the number of makespan or the total working time of all tasks until the daily orders (product) are fulfilled. Each labor can only do one task and not all of the labors are hired. We Solve the problem using tabu search algorithm. The characteristics of tabu search algorithm in finding solution are simple and flexible. Out of 100 iterations, the best solution ends at 613,879 seconds. Iteration lasts for 2 minutes and 31 seconds. The solution requires a total of 26 workers. Gluing needs 8 people, Wrapping needs 5 people, Tying needs 5 people, Strapping needs 4 people and Jointing needs 4 people.