A method for pre-processing scheduling of Virtual Links, VLs, contained in a Time-Triggered Ethernet, TTE, network in predefined priority order for use by a Network Scheduling Tool, NST, the method comprising the steps of: pre-processing, by a scheduling algorithm implemented by the NST, VL information prior to initiating a scheduling procedure of a set of VLs, the pre-processing comprising the steps of: detecting, by the scheduling algorithm implemented by the NST, VL information associated with the set of VLs that utilize one or more common physical resources of the TTE network wherein the one or more common physical resources at least comprise a common direction of a switching port or an egress end system port; and storing, by the scheduling algorithm implemented by the NST, the VL information associated with the set of VLs in a memory for retrieval by the NST to parse a VL list for scheduling by the scheduling algorithm to determine one or more conflicting VLs in functionalities during the scheduling procedure, and said method being characterized by further comprising the steps of: performing, by scheduling algorithm of the NST, a two-pass procedure of the set of VLs by the scheduling algorithm for identifying and prioritizing a physical resource contention between the set of VLs; scheduling, by the scheduling algorithm of the NST, a first pass of the two-pass procedure of the set of VLs that attempts to favor scheduling a VL into a bin when previously scheduled VL fails to exhibit conflicts with the VL that is scheduled; and scheduling, by the scheduling algorithm of the NST, a second pass of the two-pass procedure of the set of VLs that attempts to resolve at least one conflict exhibited in the scheduling procedure by offsetting a transmit time of the VL that is scheduled. detecting, by the scheduling algorithm implemented by the NST, VL information associated with the set of VLs that utilize one or more common physical resources of the TTE network wherein the one or more common physical resources at least comprise a common direction of a switching port or an egress end system port; and storing, by the scheduling algorithm implemented by the NST, the VL information associated with the set of VLs in a memory for retrieval by the NST to parse a VL list for scheduling by the scheduling algorithm to determine one or more conflicting VLs in functionalities during the scheduling procedure, and said method being characterized by further comprising the steps of: performing, by scheduling algorithm of the NST, a two-pass procedure of the set of VLs by the scheduling algorithm for identifying and prioritizing a physical resource contention between the set of VLs; scheduling, by the scheduling algorithm of the NST, a first pass of the two-pass procedure of the set of VLs that attempts to favor scheduling a VL into a bin when previously scheduled VL fails to exhibit conflicts with the VL that is scheduled; and scheduling, by the scheduling algorithm of the NST, a second pass of the two-pass procedure of the set of VLs that attempts to resolve at least one conflict exhibited in the scheduling procedure by offsetting a transmit time of the VL that is scheduled. performing, by scheduling algorithm of the NST, a two-pass procedure of the set of VLs by the scheduling algorithm for identifying and prioritizing a physical resource contention between the set of VLs; scheduling, by the scheduling algorithm of the NST, a first pass of the two-pass procedure of the set of VLs that attempts to favor scheduling a VL into a bin when previously scheduled VL fails to exhibit conflicts with the VL that is scheduled; and scheduling, by the scheduling algorithm of the NST, a second pass of the two-pass procedure of the set of VLs that attempts to resolve at least one conflict exhibited in the scheduling procedure by offsetting a transmit time of the VL that is scheduled.