In modern intelligent manufacturing workshops, researchers increasingly integrate the transportation of Automated Guided Vehicles (AGVs) with production scheduling to enhance overall efficiency. However, in real-world production scenarios, such integrated scheduling systems are highly susceptible to stochastic disturbances stemming from unexpected equipment failures, thereby significantly undermining operational efficiency. This study focuses on the dynamic lot-streaming hybrid flowshop scheduling problem with automated guided vehicles (DLSHFSP–AGV) under a disruption-prone environment. A multi-objective mixed-integer linear programming model that accounts for machine and AGV failures is developed. Based on this model, an event-driven partial rescheduling strategy is proposed, in which the disrupted operations and delivery tasks are classified into three categories: retained, continued, and reconstructed. On the framework of NSGA2-MDDQN (NSGA-Ⅱ- Multi-objective double-depth Q learning algorithm) algorithm, which is the basis of existing research, the dynamic encoding mechanism and multi-stage decoding strategy are innovatively introduced to realize the collaborative optimization of the machine allocation, AGV scheduling, and process sequencing of the remaining tasks after the perturbation. Experimental results demonstrate that, compared to combined scheduling rules, NSGA-II, and DDQN algorithms, the proposed method achieves improvements of 18.59%, 41.05%, and 4.26% in makespan, machine idle time, and AGV travel distance, respectively. These enhancements significantly improve the robustness and optimization performance of the scheduling scheme under dynamic perturbations, offering a reliable dynamic scheduling solution for intelligent manufacturing systems.

The integration between production and distribution to minimize total elapsed time is an important issue for industries that produce products with a short lifespan. However, the literature focus on production environments with a single stage. This paper enhances the complexity of the production system of an integrated production and distribution system by considering flowshop environment decisions integrated with a vehicle routing problem decision. In this case, each order is produced in a permutation flowshop subsystem and then shipped to its destination by a capacitated vehicle, and the objective is to sequence these orders to minimize the makespan of the schedule. This paper uses two approaches to address this integrated problem: a mixed-integer formulation and an Iterated Greedy algorithm. The experimentation shows that the Iterated Greedy algorithm yields results with a 0.02% deviation from the optimal for problems with five jobs, and is a viable option to be used in practical cases due to its short computational time.