Given m facilities each with an opening cost, n demands, and distance between every demand and facility,the Facility Location problem finds a solution which opens some facilities to connect every demand to an opened facility such that the total cost of the solution is minimized. The k-Facility Location problem further requires that the number of opened facilities is at most k, where k is a parameter given in the instance of the problem. We consider the Facility Location problems satisfying that for every demand the ratio of the longest distance to facilities and the shortest distance to facilities is at most w, where w is a predefined constant. Using the local search approach with scaling technique and error control technique, for any arbitrarily small constant ∈ > 0, we give a polynomial-time approximation algorithm for the ω-constrained Facility Location problem with approximation ratio 1 + √ω + 1 + ∈, which significantly improves the previous best known ratio (ω + 1)/α for some 1 ≤α≤ 2, and a polynomial-time approximation algorithm for the ω-constrained κ-Facility Location problem with approximation ratio ω + 1 + ∈. On the aspect of approximation hardness, we prove that unless NP (C) DTIME(nO(loglogn)), the ω-constrained Facility Location problem cannot be approximated within 1 + √ω-1,which slightly improves the previous best known hardness result 1.243 + 0.316 ln(ω - 1). The experimental results on the standard test instances of Facility Location problem show that our algorithm also has good performance in practice.