In this paper we proposed a Max-Flow Oriented Algorithm (MFOA) to achieve the shortest finish time in Time-Path
Scheduling Problem (TPSP). The signification of our algorithm is that it combines both benefits of the Max-Flow
algorithm and heuristic algorithms, so we can achieve a better result with lower time cost. Another feature of our
algorithm is that all the data on the same node in the network can be considered as a single merged data, so the time cost
is mainly depended on the network topology and the task numbers will not affect the time cost much. This feature makes
our algorithm suitable for large scale applications. In this paper we figured out the relationship of Max-Flow routing and
our objective: shortest finish time, and how the Max-Flow theoretic helps to achieve it. We also build the mathematical
model of our MFOA with Max-Flow Oriented Scheduling (MFOS) rerouting strategy. To investigate the performance of
our algorithm, we compare it with existing optimization algorithm and algorithms with 4 other heuristic rerouting
strategies. Based on the results of simulations on different topologies, our algorithm is best in most of the situations.
Besides the method used in this paper also helps to develop more efficient algorithms.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.