Spotters (also denoted as switchers) are specialized terminal tractors, which are dedicated to the rapid maneuvering of semitrailers between parking lot and dock doors in large trailer yards. This paper is dedicated to spotter scheduling, i.e., the assignment of predefined trailer movements to a given fleet of spotters. The limited number of dock doors for loading and unloading is often the scarce resource during trailer processing, so that idle time of the bottleneck, e.g., caused by unforeseen delay in the yard, is to be avoided. In this setting, we aim to insert time buffers between any pair of subsequent jobs assigned to the same spotter, so that small delays are not propagated and subsequent jobs can still be executed in a timely manner. We formalize two versions of the resulting robust spotter scheduling problem and provide efficient algorithms for finding optimal solutions in polynomial time. Furthermore, we simulate delays during the execution of spotter schedules and show that the right robustness objective can greatly improve yard performance.
This paper addresses the operational planning problem of assigning orders and pods (i.e., mobile shelves) to picking stations in a multi-level robotic mobile fulfillment system (RMFS), which deals with two issues: deciding on which picking station handles which order, and from which pods to pick the ordered items, considering the limited storage capacity of the pods. Due to the relatively poor space utilization of single-level RMFS warehouses, such systems are often spread over multiple floors in practice. Therefore, we explicitly consider multi-level warehouse layouts with isolated levels (or zones) where a pod can only be brought to a station if both of them are on the same level. We optimize the problem with regard to a multi-criteria objective function that consists of three workload-oriented objectives: we aim to balance the total workload among all pickers, minimize the total order-consolidation effort for the packers, and the pod movement effort for the mobile robots. After formalizing the planning problem as a multi-objective optimization problem, we provide two mixed-integer linear programming models. Additionally, we propose a matheuristic that reduces the model size to the desired granularity so that realistically sized problem instances can be solved within less than four minutes of computation time. Moreover, we derive some managerial insights, such as the impact of the number of warehouse levels and picking waves on the objective values. We find evidence that running the RMFS warehouse in a multi-level facility can substantially compromise the consolidation effort at packing stations since it leads to a higher number of split orders. Furthermore, splitting the planning horizon into multiple short waves can lead to a higher number of pod-to-station assignments and, thus, to a raised pod-movement workload for mobile robots.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.