A computer-implemented method, comprising: determining a first estimated arrival time for a first vehicle at a loading dock of a warehouse; determining a second estimated arrival time for a second vehicle at the loading dock of the warehouse, wherein the first estimated arrival time is before the second estimated arrival time; determining a pallet arrangement at the loading dock of the warehouse, wherein the pallet arrangement comprises a first pallet associated with the first vehicle and a second pallet associated with the second vehicle, wherein the first pallet is closer to the loading dock than the second pallet, wherein the pallet arrangement comprises at least a first queue entry and a second queue entry, each of the first queue entry and the second queue entry for holding one or more pallets, wherein a location of the first queue entry is closer to the loading dock than a location of the second queue entry, and wherein the first queue entry holds the first pallet and the second queue entry holds the second pallet; after determining the pallet arrangement, determining that the first estimated arrival time has changed to be after the second estimated arrival time; and in response to determining that the first estimated arrival time has changed to be after the second estimated arrival time, instructing a robot to modify the pallet arrangement so that the second pallet is closer to the loading dock than the first pallet before the second estimated arrival time, wherein the instructing comprises: determining a number of robots available to swap pallets at the warehouse; determining, based on historical data and one or more mathematical models, an amount of time to swap pallets between the first queue entry and the second queue entry based on the number of robots available to swap pallets; determining whether an amount of time until the second estimated arrival time is greater than the amount of time to swap pallets; and after determining that the amount of time until the second estimated arrival time is greater than the amount of time to swap pallets, instructing the robot to: move the second pallet from the second queue entry to the first queue entry, and move the first pallet from the first queue entry to the second queue entry. determining a first estimated arrival time for a first vehicle at a loading dock of a warehouse; determining a second estimated arrival time for a second vehicle at the loading dock of the warehouse, wherein the first estimated arrival time is before the second estimated arrival time; determining a pallet arrangement at the loading dock of the warehouse, wherein the pallet arrangement comprises a first pallet associated with the first vehicle and a second pallet associated with the second vehicle, wherein the first pallet is closer to the loading dock than the second pallet, wherein the pallet arrangement comprises at least a first queue entry and a second queue entry, each of the first queue entry and the second queue entry for holding one or more pallets, wherein a location of the first queue entry is closer to the loading dock than a location of the second queue entry, and wherein the first queue entry holds the first pallet and the second queue entry holds the second pallet; after determining the pallet arrangement, determining that the first estimated arrival time has changed to be after the second estimated arrival time; and in response to determining that the first estimated arrival time has changed to be after the second estimated arrival time, instructing a robot to modify the pallet arrangement so that the second pallet is closer to the loading dock than the first pallet before the second estimated arrival time, wherein the instructing comprises: determining a number of robots available to swap pallets at the warehouse; determining, based on historical data and one or more mathematical models, an amount of time to swap pallets between the first queue entry and the second queue entry based on the number of robots available to swap pallets; determining whether an amount of time until the second estimated arrival time is greater than the amount of time to swap pallets; and after determining that the amount of time until the second estimated arrival time is greater than the amount of time to swap pallets, instructing the robot to: move the second pallet from the second queue entry to the first queue entry, and move the first pallet from the first queue entry to the second queue entry. determining a number of robots available to swap pallets at the warehouse; determining, based on historical data and one or more mathematical models, an amount of time to swap pallets between the first queue entry and the second queue entry based on the number of robots available to swap pallets; determining whether an amount of time until the second estimated arrival time is greater than the amount of time to swap pallets; and after determining that the amount of time until the second estimated arrival time is greater than the amount of time to swap pallets, instructing the robot to: move the second pallet from the second queue entry to the first queue entry, and move the first pallet from the first queue entry to the second queue entry. move the second pallet from the second queue entry to the first queue entry, and move the first pallet from the first queue entry to the second queue entry.