Aiming at the logistics dynamic scheduling problem in an intelligent manufacturing workshop (IMW), an intelligent logistics scheduling model and response method with Automated Guided Vehicles (AGVs) based on the mode of “request‐scheduling‐response” were proposed, and they were integrated with Internet of Things (IoT) to meet the demands of dynamic and real time. Correspondingly, a mathematical model was developed and integrated with a double‐level hybrid genetic algorithm and ant colony optimization (DLH‐GA‐ACO) to minimize the finish time with the minimum AGVs and limited time. The mathematical model optimized the logistics scheduling process on two dimensions which include the sequence of tasks assigned to an AGV and the matching relation between transfer tasks and AGVs (AGV‐task). The effectiveness of the model was verified by a set of experiments, and comparison among DLH‐GA‐ACO, hybrid genetic algorithm and particle swarm optimization (H‐GA‐PSO), and tabu search algorithm (TSA) was performed. In the experiments, the DLH‐GA‐ACO ran in a distributed environment for a faster computing speed. According to the comparisons, the superiority and effectiveness of DLH‐GA‐ACO on dynamic simultaneous scheduling problem were proved and the intelligent logistics scheduling model was also proved to be an effective model.

Aimed at the problem of the green scheduling problem with automated guided vehicles (AGVs) in flexible manufacturing systems (FMS), the multi-objective and multi-dimensional optimal scheduling process is defined while considering energy consumption and multi-function of machines. The process is a complex and combinational process, considering this characteristic, a mathematical model was developed and integrated with evolutionary algorithms (EAs), which includes a sectional encoding genetic algorithm (SE-GA), sectional encoding discrete particle swarm optimization (SE-DPSO) and hybrid sectional encoding genetic algorithm and discrete particle swarm optimization (H-SE-GA-DPSO). In the model, the encoding of the algorithms was divided into three segments for different optimization dimensions with the objective of minimizing the makespan and energy consumption of machines and the number of AGVs. The sectional encoding described the sequence of operations of related jobs, the matching relation between transfer tasks and AGVs (AGV-task), and the matching relation between operations and machines (operation-machine) respectively for multi-dimensional optimization scheduling. The effectiveness of the proposed three EAs was verified by a typical experiment. Besides, in the experiment, a comparison among SE-GA, SE-DPSO, H-SE-GA-DPSO, hybrid genetic algorithm and particle swarm optimization (H-GA-PSO) and a tabu search algorithm (TSA) was performed. In H-GA-PSO and TSA, the former just takes the sequence of operations into account, and the latter takes both the sequence of operations and the AGV-task into account. According to the result of the comparison, the superiority of H-SE-GA-DPSO over the other algorithms was proved.

The disassembly industry is still labor-intensive, and for the disassembly of products with similar assembly structures, achieving mixed disassembly of these products on the same disassembly line is a more economical solution and very popular in disassembly companies. When large-volume end-of-life (EOL) products are disassembled on the two-sided disassembly line, there is uncertainty in the disassembly time during the disassembly process due to the differences in the recovery quality of EOL products. Therefore, a stochastic mixed-integer programming model is formulated that considers workstation activation cost, workload smoothness index between workstations, and total hazard index considering the order of hazardous task removal. Then, a multi-objective genetic flatworm algorithm is developed in which two different mechanisms for new individual generation are embedded, namely the flatworm genetic operations and the regeneration operations. The effectiveness of the model and the efficiency of the algorithm are verified by the disassembly cases of the printer and the classical mixed-model on the two-sided disassembly line. Finally, the proposed model and algorithm are applied to the disassembly of multiple types of cars, which proves their practical industrial application value.