Abstract: A Single Machine Scheduling (SMS) problems can do what necessary help and discernment to finding a solution, knowledge, control and design more complicated multi-machine scheduling problems. In this study, we suggest n-jobs be performed on one machine included the triangular fuzzy due date. The various date for each job is regard which meets the request of a customer with more gratification standard. The major aim of this study is to test the prospect of employ fuzzy distance function concepts which mention in Lam and Cai to solve SMS many aims functions one of them nonlinear lateness. We use different Local Search Algorithms (LSAs) to compare Bee Colony Algorithm (BCA), Particle Swarm Optimization (PSO) and Tabu Search (TS). All algorithms are tested and computational experiments are given in tables.