Here we have n jobs on one machine where the processing times are triangular fuzzy numbers. The available to process without interruption. purpose is find a best sequence of that minimizes total completion and maximum tardiness. In this paper new definition presented called D-strongly positive number, then an exact solution problem through found. This opens ideas about converting scheduling pro...