We　present　a　-approximation　algorithm　for　the　non-uniform　soft　capacitated　k-facility　location　problem,　violating　the　capacitated　constrains　by　no　more　than　a　factor　of　25.　The　main　technique　is　based　on　the　primal-dual　algorithm　for　the　soft　capacitated　facility　location　problem,　and　the　exploitation　of　the　combinatorial　structure　of　the　fractional　solution　for　the　soft　capacitated　k-facility　location　problem.