The integrated scheduling problem in automated storage and retrieval systems (AS/RS) and the hybrid flowshop is critical for the realization of lean logistics and just-in-time distribution in manufacturing systems. The bi-objective model that minimizes the operation time in AS/RS and the makespan in the hybrid flowshop is established to optimize the problem. A mixed algorithm, named GA-MBO algorithm, is proposed to solve the model, which combines the advantages of the strong global optimization ability of genetic algorithm (GA) and the strong local search ability of migratory birds optimization (MBO). To avoid useless solutions, different cross operations of storage and retrieval tasks are designed. Compared with three algorithms, including improved genetic algorithm, improved particle swam optimization, and a hybrid algorithm of GA and particle swam optimization, the experimental results showed that the GA-MBO algorithm improves the operation efficiency by 9.48%, 19.54%, and 5.12% and the algorithm robustness by 35.16%, 54.42%, and 39.38%, respectively, which further verified the effectiveness of the proposed algorithm. The comparative analysis of the bi-objective experimental results fully reflects the superiority of integrated scheduling optimization.

The increasing demand for storing various types of goods has led to a raise in the need for storage capacity in warehousing systems. Autonomous vehicle storage and retrieval systems (AVS/RSs) offer high flexibility by allowing different configurations to meet different storage requirements. The system mainly completes operations through elevators and multiple rail-guided vehicles (RGVs). This paper focuses on the scheduling optimization of compound operations in the AVS/RS to improve system performance. Compound operations involve the coordinated execution of both single-command and double-command operations. A mathematical model with compound operations was proposed and effectively decomposed into a horizontal component for RGVs and a vertical counterpart for the elevator, which can represent the operations of one elevator cooperating with multiple RGVs. The goal of this model was to minimize the makespan for compound operations and to determine the optimal operation sequence and path for RGVs. An improved discrete particle swarm optimization (DPSO) algorithm called AGDPSO was proposed to solve the model. The algorithm combines DPSO and a genetic algorithm in an adaptive manner to prevent the algorithm from falling into local optima and relying solely on the initial solution. Through rigorous optimization, optimal parameters for the algorithm were identified. When assessing the performance of our improved algorithm against various counterparts, considering different task durations and racking configurations, our results showed that AGDPSO outperformed the alternatives, proving its effectiveness in enhancing system efficiency for the model. The findings of this study not only contribute to the optimization of AVS/RS but also offer valuable insights for designing more efficient warehouses. By streamlining scheduling, improving operations, and leveraging advanced optimization techniques, we can create a more robust and effective storage and retrieval system.