Abstract: Systems, methods, and other embodiments associated with computing and assigning a task to be performed using a resource at a candidate time are described. In one embodiment, a method includes accessing a scheduling data structure and analyzing data records for tasks, upon which the resource depends, to be performed using one or more other resources, and tasks, upon which other resources depend, to be performed using the resource. A candidate time for performing the task using the resource is calculated based upon dependencies determined between various tasks, and a candidate schedule is generated using the candidate time for the task. The scheduling data structure is modified and regenerated based upon the candidate schedule if the candidate schedule is determined to have a greater performance score than an existing schedule.

Abstract: Computerized embodiments are disclosed for efficiently storing site-to-site transit information in a reduced amount of computer memory. In one embodiment, a transit data structure and a compensation data structure are generated and stored in memory of a computer. The transit data structure has dimensions of first job site identifiers by second job site identifiers that allow transit data cells of the transit data structure to be addressed. Each transit data cell stores a pattern index value representing a traffic pattern and a base travel time value representing a minimum travel time between two job sites. The compensation data structure has dimensions of pattern index values by level index values that allow compensation data cells of the compensation data structure to be addressed. The level index values are derived from travel conditions and vehicle conditions. Each compensation data cell stores a single byte of data for adjusting base travel time values.

Abstract: Systems, methods, and other embodiments associated with computing and assigning a task to be performed using a resource at a candidate time are described. In one embodiment, a method includes accessing a scheduling data structure and analyzing data records for tasks, upon which the resource depends, to be performed using one or more other resources, and tasks, upon which other resources depend, to be performed using the resource. A candidate time for performing the task using the resource is calculated based upon dependencies determined between various tasks, and a candidate schedule is generated using the candidate time for the task. The scheduling data structure is modified and regenerated based upon the candidate schedule if the candidate schedule is determined to have a greater performance score than an existing schedule.

Abstract: Computerized embodiments are disclosed for efficiently storing site-to-site transit information in a reduced amount of computer memory. In one embodiment, a transit data structure and a compensation data structure are generated and stored in memory of a computer. The transit data structure has dimensions of first job site identifiers by second job site identifiers that allow transit data cells of the transit data structure to be addressed. Each transit data cell stores a pattern index value representing a traffic pattern and a base travel time value representing a minimum travel time between two job sites. The compensation data structure has dimensions of pattern index values by level index values that allow compensation data cells of the compensation data structure to be addressed. The level index values are derived from travel conditions and vehicle conditions. Each compensation data cell stores a single byte of data for adjusting base travel time values.