This paper studies the multiprocessor job scheduling problem, and describes the m processors system, and analyze the algorithm for the problem of the offline version, both P_m|fix|C_max of the scheduling problem with arbitrary process time jobs, and P_m|fix, p=1|C_max of the scheduling problem with unit processing time jobs. Severalvery simple and practical polynomial time approximation algorithm are constructed, a (√2m+1)-approximation algorithm for the problem P_m|fix, p=1|C_max and a 2√m -approximation algorithm for the problem P_m|fix|C_max , by usingthe Split Scheduling (SS), the First Fit (FF) and the Large Wide First (LWF) technique. The results are better than any seen in the literature at present.