We extend the notion of chip-firing to weighted graphs, and generalize the Greedy Algorithm and Dhar's Burning Algorithm to weighted graphs. For a vertex $q \in V(Γ)$, we give an upper bound for the number of linearly equivalent $q$-reduced divisors. Finally, we illustrate a method of finding all maximal unwinnable divisors on weighted graphs.