Abstract: In this paper we study a P-AGENTS SEASONAL JOB COMPLETION MODEL problem with seasonal job completion model. There are N-cities (N=1, 2, 3….n) and J jobs (1, 2,…q). The distance between each pair of cities is mentioned and is denoted by dij. For each city seasonal jobs have been mentioned for the agents whom they have to perform them in two seasons/periods. In the distance matrix the distance between each pair of the cities is symmetric.