期刊名称：International Journal of Distributed and Parallel Systems
印刷版ISSN：2229-3957
电子版ISSN：0976-9757
出版年度：2012
卷号：3
期号：3
DOI：10.5121/ijdps.2012.3325
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：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. We have 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.
