A B C D E F G H I L M N O P R S T U V W Z

U

unmark() - Method in class edu.mit.ll.group43.surfaceoptimization.network.dp.CPSNetworkNode
 
updateBestValues() - Method in class edu.mit.ll.group43.surfaceoptimization.dp.factory.cost.AllGapsForceSpotCostStrategy
Checks the best values found for the current previous node being looked at against the best values found among all previous nodes for the current node whose last aircraft is being scheduled.
updateBestValues() - Method in class edu.mit.ll.group43.surfaceoptimization.dp.factory.cost.LenientAllGapsForceSpotCostStrategy
Updates the best recorded values for the aircraft currently being scheduled based on the best values recorded for the previous node currently under consideration.
updateCurrValues(ArrayList<Aircraft>, int, int) - Method in class edu.mit.ll.group43.surfaceoptimization.dp.factory.cost.AllGapsForceSpotCostStrategy
Updates the best sequence found so far for this node and its associated values if the given sequence is valid and incurs less delay than the one currently saved, or if there is no currently saved best sequence for this node.
updateCurrValues(ArrayList<Aircraft>, int, int) - Method in class edu.mit.ll.group43.surfaceoptimization.dp.factory.cost.LenientAllGapsForceSpotCostStrategy
Tests the given sequence and its associated values against the best recorded values for the previous node currently under consideration.
updateScheduleForSequence(ArrayList<Aircraft>, Aircraft) - Method in class edu.mit.ll.group43.surfaceoptimization.dp.factory.cost.AllGapsForceSpotCostStrategy
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, when basing this optimal schedule on the one given.
updateSequence(ArrayList<Aircraft>, Aircraft, Aircraft) - Method in class edu.mit.ll.group43.surfaceoptimization.LookAheadSequencer
 

A B C D E F G H I L M N O P R S T U V W Z