  In the past years, Interconnection Networks have been used quite often and
especially in applications where parallelization is critical. Message packets
transmitted through such networks can be interrupted using buffers in order to
maximize network usage and minimize the time required for all messages to reach
their destination. However, preempting a packet will result in topology
reconfiguration and consequently in time cost. The problem of scheduling
message packets through such a network is referred to as PBS and is known to be
NP-Hard. In this paper we have improved, critically, variations of polynomially
solvable instances of Open Shop to approximate PBS. We have combined these
variations and called the induced algorithm IHSA, Improved Hybridic Scheduling
Algorithm. We ran experiments to establish the efficiency of IHSA and found
that in all datasets used it produces schedules very close to the optimal. In
addition, we tested IHSA with datasets that follow non-uniform distributions
and provided statistical data which illustrates better its performance.To
further establish the efficiency of IHSA we ran tests to compare it to SGA,
another algorithm which when tested in the past has yielded excellent results.
