Search Results (13)

Human–machine collaborative scheduling has been widely applied in the modern manufacturing industry. Traditional scheduling algorithms often rely on frequent rescheduling when new jobs arrive, resulting in low responsiveness and difficulty in meeting the demands of high-paced production scenarios. Aiming at the hybrid human–machine collaborative flexible job shop scheduling problem (HHCFJSP) with random job arrivals, this paper proposes a hybrid algorithm based on improved job insertion strategy (HAIJI) dedicated to coping with sudden job insertion demands during the scheduling process. The algorithm constructs a two-dimensional evaluation vector based on minimum scheduling delay and residual scheduling flexibility to jointly assess potential insertion positions for each operation. A non-dominated sorting mechanism is employed to identify a set of promising insertion candidates, which are further evaluated using a tailored evaluation function. During the construction of the insertion plan, an A*-inspired greedy search strategy is adopted to guide the search process, followed by a backtracking mechanism to recover the globally optimal insertion sequence. Finally, the proposed algorithm is applied to the pre-scheduling phase and the dynamic rescheduling phase of a hybrid human–machine collaborative flexible job shop. Experimental results demonstrate that the proposed method achieves higher scheduling efficiency and stability in both stages and outperforms benchmark algorithms in terms of makespan and response time. Full article

Dueto uncertainties in real-world production, dynamic factors have become increasingly critical in the research of distributed flexible job shop scheduling problems. Effectively responding to dynamic events can significantly enhance the adaptability and quality of scheduling solutions, thereby improving the resilience of manufacturing systems. This study addresses the dynamic distributed flexible job shop scheduling problem, which involves random job arrivals and machine breakdowns, and proposes an effective discrete improved gray wolf optimization (DIGWO) algorithm-based predictive–reactive method. The first contribution of our work lies in its dynamic scheduling strategy: a periodic- and event-driven approach is used to capture the dynamic nature of the problem, and a static scheduling window is constructed based on updated factory and workshop statuses to convert dynamic scheduling into static scheduling at each rescheduling point. Second, a mathematical model of multi-objective distributed flexible job shop scheduling (MODDFJSP) is established, optimizing makespan, tardiness, maximal factory load, and stability. The novelty of the model is that it is capable of optimizing both production efficiency and operational stability in the workshop. Third, by designing an efficacious initialization mechanism, prey search, and an external archive, the DIGWO algorithm is developed to solve conflicting objectives and search for a set of trade-off solutions. Experimental results in a simulated dynamic distributed flexible job shop demonstrate that DIGWO outperforms three well-known algorithms (NSGA-II, SPEA2, and MOEA/D). The proposed method also surpasses completely reactive scheduling approaches based on rule combinations. This study provides a reference for distributed manufacturing systems facing random job arrivals and machine breakdowns. Full article

In this paper, a dynamic energy-efficient hybrid flow shop (TDEHFSP) scheduling model is proposed, considering random arrivals of new jobs and transport by transfer vehicles. To simultaneously optimise the maximum completion time and the total energy consumption, a co-evolutionary approach (DDQCE) using a double deep Q-network (DDQN) is introduced, where global and local search tasks are assigned to different populations to optimise the use of computational resources. In addition, a multi-objective NEW heuristic strategy is implemented to generate an initial population with enhanced convergence and diversity. The DDQCE incorporates an energy-efficient strategy based on time interval ‘left shift’ and turn-on/off mechanisms, alongside a rescheduling model to manage dynamic disturbances. In addition, 36 test instances of varying sizes, simplified from the excavator boom manufacturing process, are designed for comparative experiments with traditional algorithms. The experimental results demonstrate that DDQCE achieves 40% more Pareto-optimal solutions compared to NSGA-II and MOEA/D while requiring 10% less computational time, confirming that this algorithm efficiently solves the TDEHFSP problem. Full article

This paper introduces the Improved Evolution Strategy Reinforcement Learning (I-ES) algorithm. The I-ES algorithm is designed to minimize the makespan and total energy consumption (TEC) in a multi-objective dynamic scheduling problem within a hybrid flow shop. It addresses key challenges such as flexible preventive maintenance for machines, random job arrivals, uncertain processing times, and the setup time. An experimental comparison of the I-ES-based approach with Evolution Strategy Reinforcement Learning (ES) algorithms and scheduling rules, which are a combination of job selection rules and machine selection rules, has been carried out by designing problem examples. The Generational Distance (GD) and Inverted Generational Distance (IGD) metrics of the I-ES algorithm are obtained by averaging all the instances as 389.14 and 1476.25, respectively, which are smaller than the other compared algorithms, so the results show that the I-ES algorithm can obtain solutions with superior convergence compared to that of the ES algorithm and dispatching rules. Full article

In today’s customer-centric economy, the demand for personalized products has compelled corporations to develop manufacturing processes that are more flexible, efficient, and cost-effective. Flexible job shops offer organizations the agility and cost-efficiency that traditional manufacturing processes lack. However, the dynamics of modern manufacturing, including machine breakdown and new order arrivals, introduce unpredictability and complexity. This study investigates the multiplicity dynamic flexible job shop scheduling problem (MDFJSP) with new order arrivals. To address this problem, we incorporate the fluid model to propose a fluid randomized adaptive search (FRAS) algorithm, comprising a construction phase and a local search phase. Firstly, in the construction phase, a fluid construction heuristic with an online fluid dynamic tracking policy generates high-quality initial solutions. Secondly, in the local search phase, we employ an improved tabu search procedure to enhance search efficiency in the solution space, incorporating symmetry considerations. The results of the numerical experiments demonstrate the superior effectiveness of the FRAS algorithm in solving the MDFJSP when compared to other algorithms. Specifically, the proposed algorithm demonstrates a superior quality of solution relative to existing algorithms, with an average improvement of 29.90%; and exhibits an acceleration in solution speed, with an average increase of 1.95%. Full article

Efficiently managing resource utilization is critical in manufacturing systems to optimize production efficiency, especially in dynamic environments where jobs continually enter the system and machine breakdowns are potential occurrences. In fully automated environments, co-ordinating the transport system with other resources is paramount for smooth operations. Despite extensive research exploring the impact of job characteristics, such as fixed or variable task-processing times and job arrival rates, the role of the transport system has been relatively underexplored. This paper specifically addresses the utilization of a conveyor belt as the primary mode of transportation among a set of production machines. In this configuration, no input or output buffers exist at the machines, and the transport times are contingent on machine availability. In order to tackle this challenge, we introduce a randomized heuristic approach designed to swiftly identify a near-optimal joint schedule for job processing and transfer. Our solution has undergone testing on both state-of-the-art benchmarks and real-world instances, showcasing its ability to accurately predict the overall processing time of a production line. With respect to our previous work, we specifically consider the case of the arrival of a dynamic job, which requires a different design approach since there is a need to keep track of partially processed jobs, jobs that are waiting, and newly arrived jobs. We adopt a total rescheduling strategy and, in order to show its performance, we consider a clairvoyant scheduling approach, in which job arrivals are known in advance. We show that the total rescheduling strategy yields a scheduling solution that is close to optimal. Full article

Producers are encouraged to reduce their energy consumption of manufacturing systems by applying less-energy-intensive modern technologies and advanced machine tools and operating methods at the system level. In the paper, organizational and analytical solutions are combined to model the sustainable production system. Managers can study the behavior of a production system organized using energy-saving rules by changing key parameters of the input model (arrival intensity, bottleneck service rate, buffer size, setup and shutdown time) to analyze the queue size of the production system and therefore performance. A discrete-time queueing model of a single-bottleneck production line with a finite input buffer capacity is proposed. Jobs occur according to a binomial process and are processed individually, one by one, according to the natural FIFO service discipline, with a general discrete-type cumulative distribution function. The total number of jobs present in the system is bounded by a non-random fixed value N. Every time the system becomes empty, an energy-saving mechanism is started: the processing machine (server) is turned off during a geometrically distributed shutdown time. Similarly, the first job arriving into the empty system initializes a geometrically distributed setup time. Identifying renewal moments in the evolution of the model, a system of difference equations is built for the transient queue-size distribution conditioned by the state of the system at the opening. The solution is obtained explicitly in terms of probability-generating functions. In addition, the Drum-Buffer-Rope concept is proposed to reduce the energy consumption of the production line. The throughput of the production system is maximized by adjusting the time between the order arrivals and the size of the input buffer to the capacity of the bottleneck. Turning off a machine under certain conditions and slowing down non-critical machines are strategies to reduce energy consumption. A detailed illustrating numerical and simulation study of the considered model is attached as well, in which the sensitivity of the queue-size behavior to changes of the key input model parameters is investigated. Full article

With the development of intelligent manufacturing, machine tools are considered the “mothership” of the equipment manufacturing industry, and the associated processing workshops are becoming more high-end, flexible, intelligent, and green. As the core of manufacturing management in a smart shop floor, research into the multi-objective dynamic flexible job shop scheduling problem (MODFJSP) focuses on optimizing scheduling decisions in real time according to changes in the production environment. In this paper, hierarchical reinforcement learning (HRL) is proposed to solve the MODFJSP considering random job arrival, with a focus on achieving the two practical goals of minimizing penalties for earliness and tardiness and reducing total machine load. A two-layer hierarchical architecture is proposed, namely the combination of a double deep $Q$-network (DDQN) and a dueling DDQN (DDDQN), and state features, actions, and external and internal rewards are designed. Meanwhile, a personal computer-based interaction feature is designed to integrate subjective decision information into the real-time optimization of HRL to obtain a satisfactory compromise. In addition, the proposed HRL framework is applied to multi-objective real-time flexible scheduling in a smart gear production workshop, and the experimental results show that the proposed HRL algorithm outperforms other reinforcement learning (RL) algorithms, metaheuristics, and heuristics in terms of solution quality and generalization and has the added benefit of real-time characteristics. Full article

The production process of a smart factory is complex and dynamic. As the core of manufacturing management, the research into the flexible job shop scheduling problem (FJSP) focuses on optimizing scheduling decisions in real time, according to the changes in the production environment. In this paper, deep reinforcement learning (DRL) is proposed to solve the dynamic FJSP (DFJSP) with random job arrival, with the goal of minimizing penalties for earliness and tardiness. A double deep Q-networks (DDQN) architecture is proposed and state features, actions and rewards are designed. A soft ε-greedy behavior policy is designed according to the scale of the problem. The experimental results show that the proposed DRL is better than other reinforcement learning (RL) algorithms, heuristics and metaheuristics in terms of solution quality and generalization. In addition, the soft ε-greedy strategy reasonably balances exploration and exploitation, thereby improving the learning efficiency of the scheduling agent. The DRL method is adaptive to the dynamic changes of the production environment in a flexible job shop, which contributes to the establishment of a flexible scheduling system with self-learning, real-time optimization and intelligent decision-making. Full article

In modern manufacturing industry, the methods supporting real-time decision-making are the urgent requirement to response the uncertainty and complexity in intelligent production process. In this paper, a novel closed-loop scheduling framework is proposed to achieve real-time decision making by calling the appropriate data-driven dispatching rules at each rescheduling point. This framework contains four parts: offline training, online decision-making, data base and rules base. In the offline training part, the potential and appropriate dispatching rules with managers’ expectations are explored successfully by an improved gene expression program (IGEP) from the historical production data, not just the available or predictable information of the shop floor. In the online decision-making part, the intelligent shop floor will implement the scheduling scheme which is scheduled by the appropriate dispatching rules from rules base and store the production data into the data base. This approach is evaluated in a scenario of the intelligent job shop with random jobs arrival. Numerical experiments demonstrate that the proposed method outperformed the existing well-known single and combination dispatching rules or the discovered dispatching rules via metaheuristic algorithm in term of makespan, total flow time and tardiness. Full article

The development of industrial-enabling technology, such as the industrial Internet of Things and physical network system, makes it possible to use real-time information in production-logistics scheduling. Real-time information in an intelligent factory is random, such as the arrival of customers’ jobs, and fuzzy, such as the processing time of Production-Logistics Resources. Besides, the coordination of production and logistic resources in a flexible workshop is also a hot issue. The availability of this information will enhance the quality of making scheduling decisions. However, when and how to use this information to realize the adaptive collaboration of Production-Logistics Resources are vital issues. Therefore, this paper studies the above problems by establishing a real-time reaction scheduling framework of Production-Logistics Resources dynamic cooperation. Firstly, a real-time task triggering strategy to maximize information utilization is proposed to explore when to use real-time information. Secondly, a collaborative method for Production-Logistics Resources is studied to explore how to use real-time information. Thirdly, a real-time self-adaptive scheduling algorithm based on information entropy is utilized to obtain a stable and feasible solution. Finally, the effectiveness and advancement of the proposed method are verified by a practical case. Full article

In recent years, the individualized demand of customers brings small batches and diversification of orders towards enterprises. The application of enabling technologies in the factory, such as the industrial Internet of things (IIoT) and cloud manufacturing (CMfg), enhances the ability of customer requirement automatic elicitation and the manufacturing process control. The job shop scheduling problem with a random job arrival time dramatically increases the difficulty in process management. Thus, how to collaboratively schedule the production and logistics resources in the shop floor is very challenging, and it has a fundamental and practical significance of achieving the competitiveness for an enterprise. To address this issue, the real-time model of production and logistics resources is built firstly. Then, the task entropy model is built based on the task information. Finally, the real-time self-adaption collaboration of production and logistics resources is realized. The proposed algorithm is carried out based on a practical case to evaluate its effectiveness. Experimental results show that our proposed algorithm outperforms three existing algorithms. Full article

An acoustic transmitter can be located by having multiple static microphones. These microphones are synchronized and measure the time differences of arrival (TDoA). Usually, the positions of the microphones are assumed to be known in advance. However, in practice, this means they have to be manually measured, which is a cumbersome job and is prone to errors. In this paper, we present two novel approaches which do not require manual measurement of the receiver positions. The first method uses an inertial measurement unit (IMU), in addition to the acoustic transmitter, to estimate the positions of the receivers. By using an IMU as an additional source of information, the non-convex optimizers are less likely to fall into local minima. Consequently, the success rate is increased and measurements with large errors have less influence on the final estimation. The second method we present in this paper consists of using machine learning to learn the TDoA signatures of certain regions of the localization area. By doing this, the target can be located without knowing where the microphones are and whether the received signals are in line-of-sight or not. We use an artificial neural network and random forest classification for this purpose. Full article