A heuristic for the Network Migration Scheduling Problem

In the present paper, we consider the Network Migration Scheduling Problem which consists of finding an order of migration of the nodes from an outdated network to a new one. It has been shown that this problem is very difficult to solve exactly even for small instances. We give a simple heuristic based on sorting the demands according to the decreasing order of their size. Through computational experiments, we show that this heuristic is computationally rapid and provides near optimal solutions.