This paper gives a unified approach to the design of linear time algorithms for the weighted perfect domination problem and its three variants on interval graphs. The results are then extended to solve the same problems on circular-arc graphs in O(|E| |V| + |V|2) time, where VM and E are the vertex set and edge set of the given graph, respectively.