Capacitated dynamic location problems with opening, closure and reopening of facilities

In this paper a capacitated dynamic location problem with opening, closure and reopening of facilities is formulated and a primal–dual heuristic that can solve this problem is described. In this problem both maximum and minimum capacity restrictions are considered. The problem formulated is NP-hard. Computational results are presented and discussed.