Patent ID: 8260650
Filing Date: 2012-09-04
Classification: G06Q

Abstract:
1. A computer-implemented method of generating a schedule for a transportation operation, comprising: a) providing one or more lists of available resources and an ordered list of a plurality of demands for transportation between a plurality of origins and a plurality of destinations in a memory of a computer, each demand being associated with an origin, a destination and a departure time; b) using a processor of the computer to set a schedule fragment to satisfy one of the demands in the ordered list, the step of setting the schedule fragment including assigning a resource from the one or more lists of available resources by: c) using the processor of the computer to modify the one or more lists of available resources in the memory to indicate a revised state based on the assignment of resources in step (b); and d) using the processor of the computer to repeat steps (b) and (c) so that steps (b) and (c) are performed for the plurality of demands according to the order of the demands in the list and so that step (b) for each demand is performed using the state resulting from step (c) for the immediately previous demand.