%0 Journal Article
%T Path Optimization Algorithm For Network Problems Using Job Sequencing Technique
%A Punit Kumar Singh
%A Rakesh Kumar
%J International Journal of Distributed and Parallel Systems
%D 2012
%I Academy & Industry Research Collaboration Center (AIRCC)
%X The job sequencing technique is used to determine an optimal sequence. It performs a series of jobs by a number of specific orders so that it calculates the optimal cost. In this paper, we propose a novel approach to find an optimal path from source to destination by taking advantage of job sequencing technique. Wehave used n jobs m machine sequencing technique and this is divided into n jobs 2 machine problems. Using Johnson¡¯s sequencing rule, we solved the problem and obtained the (n-1) sub sequences of the route. Using the proposed algorithm, we calculated the optimal sequence, which leads to the shortest path of the network.
%K Job sequencing technique
%K Optimal sequence
%K minimal path
%K optimal distance
%K Johnson¡¯s sequencing rule
%K MPLS..
%U http://airccse.org/journal/ijdps/papers/0512ijdps25.pdf