In distributed manufacturing systems, the goal is to process jobs on several factories with different number of machines. Each machine has given processing and setup times that depend on the jobs. The problem of seeking solutions minimizing total production time (makespan), reducing tardiness, or maximizing resources utilization is known as Job Shop Scheduling problem. However, in this problem, each factory may have specific priorities or local objectives. On the other hand, global objectives of the organization can also exist. Thus, this paper studies the effect of these factory local objectives in Distributed Job Shop Scheduling Problems (DJSS). Some instances of the DJSS problems are solved using NSGA-III considering various combinations of local objectives with global ones in a multi-objective context. The trade-off solutions obtained are compared and analyzed. These preliminary results indicate the usefulness and validity of this approach.