The job shop scheduling problem (JSSP) is a classical NP-hard combinatorial optimization challenge that plays a crucial role in manufacturing systems. Deep reinforcement learning has shown great potential in solving this problem. However, it still has challenges in reward function design and state feature representation, which makes it suffer from slow policy convergence and low learning efficiency in complex production environments. Therefore, a human feedback-based large language model-assisted deep reinforcement learning (HFLLMDRL) framework is proposed to solve this problem, in which few-shot prompt engineering by human feedback is utilized to assist in designing instructive reward functions and guiding policy convergence. Additionally, a self-adaptation symbolic visualization Kolmogorov–Arnold Network (KAN) is integrated as the policy network in DRL to enhance state feature representation, thereby improving learning efficiency. Experimental results demonstrate that the proposed framework significantly boosts both learning performance and policy convergence, presenting a novel approach to the JSSP.

Under the background of intelligent manufacturing, industrial systems are developing in a more complex and intelligent direction. Equipment maintenance management is facing significant challenges in terms of maintenance workload, system reliability and stability requirements and the overall skill requirements of maintenance personnel. Equipment maintenance management is also developing in the direction of intellectualization. It is important to have a method to construct a domain knowledge graph and to organize and utilize it. As is well known, traditional equipment maintenance is mainly dependent on technicians, and they are required to be very familiar with the maintenance manuals. But it is very difficult to manage and exploit a large quantity of knowledge for technicians in a short time. Hence a method to construct a knowledge graph (KG) for equipment maintenance is proposed to extract knowledge from manuals, and an effective maintenance scheme is obtained with this knowledge graph. Firstly, a joint model based on an enhanced BERT-Bi-LSTM-CRF is put forward to extract knowledge automatically, and a Cosine and Inverse Document Frequency (IDF) based on semantic similarity a presented to eliminate redundancy in the process of the knowledge fusion. Finally, a Decision Support System (DSS) for equipment maintenance is developed and implemented, in which knowledge can be extracted automatically and provide an equipment maintenance scheme according to the requirements. The experimental results show that the joint model used in this paper performs well on Chinese text related to equipment maintenance, with an F1 score of 0.847. The quality of the knowledge graph constructed after eliminating redundancy is also significantly improved.

In urban logistics distribution, vehicle carbon emissions during the distribution process significantly contribute to environmental pollution. While developing green logistics is critical for the sustainable growth of the logistics industry, existing studies often overlook the potential benefits of depot sharing among enterprises. By enabling depots belonging to different enterprises to be shared, it would shorten the distance traveled by vehicles returning to depots and reduce carbon emissions. And it would also reduce the number of depots being built. Therefore, a green vehicle routing problem with depot sharing is presented in the paper. To solve this problem, an improved adaptive large neighborhood search algorithm is presented, in which the Split strategy and two new operators are proposed to enhance solution quality and computational efficiency. Extensive numerical experiments are conducted on instances of varying scales to evaluate this algorithm, and also demonstrate its effectiveness and efficiency. Furthermore, the experimental results demonstrate that depot sharing significantly reduces carbon emissions, achieving an average optimization rate of 10.1% across all instances compared to returning to the original depot.

With the increasingly busy transportation of cargo at container terminals (CTs), the requirements for terminal throughput and operational efficiency are constantly increasing. The operational efficiency and cost of CTs are closely related to the seamless docking of terminal facilities, especially the joint operation between berths and quay cranes (QCs). Therefore, a joint allocation problem of berths and QCs (BACASP) is presented in this paper and formalized as a mathematical model to minimize terminal operation costs and shipowner dissatisfaction. Given that BACASP is an NP-hard problem, an improved multi-objective cuckoo search (IMOCS) algorithm is proposed to solve this problem, in which an elite-guided tangent flight strategy is presented to speed up the convergence for making up the lack of random search direction of the traditional cuckoo search algorithm; and an information-enhanced abandonment strategy is put forward to increase the possibility of escaping from local optima. Numerical experimental results show the effectiveness of the proposed algorithm.

With the rapid development of global trade, the cargo throughput of automated container terminals (ACTs) has increased significantly. To meet the demands of large-scale, high-intensity, and high-efficiency ACT operations, the seamless integration of various terminal facilities has become crucial, particularly the collaboration between yard cranes (YCs) and automated guided vehicles (AGVs). Therefore, an integrated scheduling problem for YCs and AGVs (YAAISP) is proposed and formulated in this paper, considering stacking containers and bidirectional transport of AGVs. As the YAAISP is an NP-hard problem, an Improved Whale Optimization Algorithm (IWOA) is proposed in which a reverse learning strategy is used for the population to enhance population diversity; a random difference variation strategy is employed to improve individual exploration capabilities; and a nonlinear convergence factor alongside an adaptive weighting mechanism to dynamically balance global exploration and local exploitation. For container tasks of size 100, the objective function value (OFV) of the IWOA was reduced by 9.25% compared to the standard Whale Optimization Algorithm. Comparisons with other algorithms, such as the Genetic Algorithm, Particle Swarm Optimization, and Grey Wolf Optimizer, showed an OFV reduction of 9.61% to 11.75%. This validates the superiority of the proposed method.