A company has various ways to make employees feel safe and comfortable while working. One of the policies adopted by the company in this case study is to provide buses as facilities for employees to pick them up from several locations and drop them off at different points. This paper seeks to implement the development of Vehicle Routing Problem Split Delivery with Time Windows (VRPSDTW). Routing and scheduling employee transportation is an NP-Hard problem, which is difficult to solve with conventional methods and requires a long computational time to obtain the optimal solution, because this research has many constraints that must be solved. The study proposed to use Tabu Search with two scenarios, which is variation in the number and the locations of the bus starting points. The resulting solution is better than the existing scheduling implemented by the company, in the case it is also able to reduce fuel costs by 8% for Scenario 1 and by 7% for Scenario 2, as obtained from the total distance traveled by shorter buses.