Calculates the earliest that the current aircraft should be released from the
spot without violating constrained position shifting for the given release
sequence.
Returns zero as the "predecessor bound" since setting it the same way that
other forcing algorithms set it would limit the invalid sequences that it
considers.
Computes the earliest time at which current can be released, with respect
to its release sequence predecessors in the spot release sequence of the
given previous node.
Solves for the best schedule where the current aircraft's optimal
spot release time is the most recently calculated, when following
the previous node currently being considered.
Schedules the current aircraft and determines the best sequences that include it
according to the best sequences saved in the previous node currently being considered.
Implementations of this abstract class are responsible for optimally
re-sequencing the FCFS sequence they are given, with respect to
minimum separation requirements and CPS.
Factory implementation for a dynamic programming sequencer that
minimizes delay at the spot while keeping the spot release
and takeoff sequences the same.
Spot cost strategy for All Gaps that considers an entire spot release sequence
when determining the predecessor bound rather than just the optimal spot release
time of the last released aircraft.
CPS network node factory that returns instances of the SmartCPSNetworkNode
class, which can keep track of a projected takeoff sequence specific to
when that node's last aircraft is told to leave the spot.
Cost strategy for optimizing at the spot by setting the
optimal spot release times, in addition to the total
distance from the start and the optimal previous node.