Search

Production rescheduling involves re-optimizing production schedules in response to disruptions that render the initial schedule inefficient or unfeasible. This process requires simultaneous consideration of multiple objectives to develop new schedules that are both efficient and stable. However, existing review papers have paid limited attention to the multi-objective optimization techniques employed in this context. To address this gap, this paper presents a systematic literature review on multi-objective production rescheduling, examining diverse shop-floor environments. Adhering to the PRISMA guidelines, a total of 291 papers were identified. From this pool, studies meeting the inclusion criteria were selected and analyzed to provide a comprehensive overview of the problems tackled, dynamic events managed, objectives considered, and optimization approaches discussed in the literature. This review highlights the primary multi-objective optimization methods used in relation to rescheduling strategies and the dynamic disruptive events studied. Findings reveal a growing interest in this research area, with "a priori" and "a posteriori" optimization methods being the most commonly implemented and a notable rise in the use of the latter. Hybridized algorithms have shown superior performance compared to standalone algorithms by leveraging combined strengths and mitigating individual weaknesses. Additionally, "interactive" and "Pareto pruning" methods, as well as the consideration of human factors in flexible production systems, remain under-explored. [ABSTRACT FROM AUTHOR]

With the rapid development of economic globalization and green manufacturing, traditional flexible job shop scheduling has evolved into the low-carbon heterogeneous distributed flexible job shop scheduling problem (LHDFJSP). Additionally, modern smart manufacturing processes encounter complex and diverse contingencies, necessitating the ability to address dynamic events in real-world production activities. To date, there are limited studies that comprehensively address the intricate factors associated with the LHDFJSP, including workshop heterogeneity, job insertions and transfers, and considerations of low-carbon objectives. This paper establishes a multi-objective mathematical model with the goal of minimizing the total weighted tardiness and total energy consumption. To effectively solve this problem, diverse composite scheduling rules are formulated, alongside the application of a deep reinforcement learning (DRL) framework, i.e., Rainbow deep-Q network (Rainbow DQN), to learn the optimal scheduling strategy at each decision point in a dynamic environment. To verify the effectiveness of the proposed method, this paper extends the standard dataset to adapt to the LHDFJSP. Evaluation results confirm the generalization and robustness of the presented Rainbow DQN-based method. [ABSTRACT FROM AUTHOR]

Assembly Workshops with Island Layout (AWIL) possess flexible production capabilities that realize product diversification. To cope with the complex scheduling challenges in flexible workshops, improve resource utilization, reduce waste, and enhance production efficiency, this paper proposes a production scheduling method for flexible assembly workshops with an island layout based on digital twin technology. A digital twin model of the workshop is established according to production demands to simulate scheduling operations and deal with complex scheduling issues. A workshop monitoring system is developed to quickly identify abnormal events. By employing an event-driven rolling-window rescheduling technique, a dynamic scheduling service system is constructed. The rolling window decomposes scheduling problems into consecutive static scheduling intervals based on abnormal events, and a genetic algorithm is used to optimize each interval in real time. This approach provides accurate, real-time scheduling decisions to manage disturbances in workshop production, which can enhance flexibility in the production process, and allows rapid adjustments to production plans. Therefore, the digital twin system improves the sustainability of the production system, which will provide a theoretical research foundation for the real-time and unmanned production scheduling process, thereby achieving sustainable development of production. [ABSTRACT FROM AUTHOR]

Because disruption happens unpredictably and generates serious impact in supply chain and production environments in the real world, it is important to develop approaches to handle disruption. This paper investigates disruption handling in part input sequencing of flexible manufacturing systems (FMSs). An algorithm is proposed for FMS part input sequencing to handle machine breakage. Evaluation is performed for the proposed algorithm by simulation experiments and result analyses. Finally, conclusions are summarized with managerial implications discussed and further research works suggested. [ABSTRACT FROM AUTHOR]

The plant protection unmanned aerial vehicle (UAV) scheduling model is of great significance to improve the operation income of UAV plant protection teams and ensure the quality of the operation. The simulated annealing algorithm (SA) is often used in the optimization solution of scheduling models, but the SA algorithm has the disadvantages of easily falling into local optimum and slow convergence speed. In addition, the current research on the UAV scheduling model for plant protection is mainly oriented to static scenarios. In the actual operation process, the UAV plant protection team often faces unexpected situations, such as new orders and changes in transfer path costs. The static model cannot adapt to such emergencies. In order to solve the above problems, this paper proposes to use the Levi distribution method to improve the simulated annealing algorithm, and it proposes a dynamic scheduling model driven by unexpected events, such as new orders and transfer path changes. Order sorting takes into account such factors as the UAV plant protection team's operating income, order time window, and job urgency, and prioritizes job orders. In the aspect of order allocation and solution, this paper proposes a Levy annealing algorithm (Levy-SA) to solve the scheduling strategy of plant protection UAVs in order to solve the problem that the traditional SA is easy to fall into local optimum and the convergence speed is slow. This paper takes the plant protection operation scenario of "one spray and three defenses" for wheat in Nanjing City, Jiangsu Province, as an example, to test the plant protection UAV scheduling model under the dynamic conditions of new orders and changes in transfer costs. The results show that the plant protection UAV dynamic scheduling model proposed in this paper can meet the needs of plant protection UAV scheduling operations in static and dynamic scenarios. Compared with SA and greedy best first search algorithm (GBFS), the proposed Levy-SA has better performance in static and dynamic programming scenarios. It has more advantages in terms of man-machine adjustment distance and total operation time. This research can provide a scientific basis for the dynamic scheduling and decision analysis of plant protection UAVs, and provide a reference for the development of an agricultural machinery intelligent scheduling system. [ABSTRACT FROM AUTHOR]

In this paper, the Neuro-Evolution of Augmenting Topologies (NEAT) algorithm is proposed to minimize the maximum completion time in a dynamic scheduling problem of hybrid flow shops. In hybrid flow shops, machines require flexible preventive maintenance and jobs arrive randomly with uncertain processing times. The NEAT-based approach is experimentally compared with the SPT and FIFO scheduling rules by designing problem instances. The results show that the NEAT-based scheduling method can obtain solutions with better convergence while responding quickly compared to the scheduling rules. [ABSTRACT FROM AUTHOR]

In the real world of manufacturing systems, production planning is crucial for organizing and optimizing various manufacturing process components. The objective of this paper is to present a methodology for both static scheduling and dynamic scheduling. In the proposed method, a hybrid algorithm is utilized to optimize the static flexible job-shop scheduling problem (FJSP) and dynamic flexible job-shop scheduling problem (DFJSP). This algorithm integrates the genetic algorithm (GA) as a global optimization technique with a simulated annealing (SA) algorithm serving as a local search optimization approach to accelerate convergence and prevent getting stuck in local minima. Additionally, variable neighborhood search (VNS) is utilized for efficient neighborhood search within this hybrid algorithm framework. For the FJSP, the proposed hybrid algorithm is simulated on a 40-benchmark dataset to evaluate its performance. Comparisons among the proposed hybrid algorithm and other algorithms are provided to show the effectiveness of the proposed algorithm, ensuring that the proposed hybrid algorithm can efficiently solve the FJSP, with 38 out of 40 instances demonstrating better results. The primary objective of this study is to perform dynamic scheduling on two datasets, including both single-purpose machine and multi-purpose machine datasets, using the proposed hybrid algorithm with a rescheduling strategy. By observing the results of the DFJSP, dynamic events such as a single machine breakdown, a single job arrival, multiple machine breakdowns, and multiple job arrivals demonstrate that the proposed hybrid algorithm with the rescheduling strategy achieves significant improvement and the proposed method obtains the best new solution, resulting in a significant decrease in makespan. [ABSTRACT FROM AUTHOR]

Standing on the brink of the fourth industrial revolution, Cyber Physical Systems (CPS) are considered the basic components of the Smart Factory. One important challenge in cyber physical production systems is dynamic scheduling that can handle random disruptions such as failures, raw material shortages and quality defects. To achieve dynamic scheduling, we have proposed a Supervised and Distributed Holonic architecture we called SUDIHA. This architecture incorporates three Holons: Product Holon, Resource Holon and Order Holon and combines global supervision, achieved by Product Holon, with dynamic local control, achieved by Resource Holon. The Digital Twin (DT) concept is generally used to design CPS; it is virtual copies of the system that can interact with the physical counterparts in a bi-directional way. It seems to be promising to tackle the complexity and increase manufacturing system flexibility. In this paper, we use a DT Model to improve the SUDIHA architecture. We propose a Digital Twin based SUDIHA architecture (DT-SUDIHA). The paper will describe Digital Twins' configuration of each Holon of the SUDIHA Architecture, and the intelligent and real time data driven operation control of this architecture. A case study is carried out at the ENSAM-Meknes flexible workshop to prove the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]

Berth allocation is a critical concern in container terminal port logistics, involving the precise determination of where and when arriving vessels should dock along a quay. With berth space limitations and a continuous surge in container handling demands, ensuring an effective berth allocation is paramount for the smooth and efficient operation of container ports. However, due to the randomness of vessel arrival times and uncertainties surrounding container ship loading capacities, berth allocation problems (BAP) often present discrete and dynamic challenges. This paper addresses these challenges by considering real-world terminal operational factors, formulating relevant assumptions, and establishing a model for dynamic berth allocation and efficient ship berthing scheduling. The primary motivation stems from the parallels observed between the BAP problem and ant foraging path selection, leading to the proposal of a novel Parallel Search Structure Enhanced Ant Colony Algorithm (PACO). A proper set of parameters of the algorithm are selected based upon sensitivity analyses on the convergence and parallelism efficiency of the algorithm. To validate our method, a real-world case-container terminal operation in Shanghai Port was studied. The experimental comparison results show that the PACO algorithm outperforms other commonly used algorithms, making it more effective and efficient for the Discrete Dynamic Berth Allocation Problem (DDBAP). [ABSTRACT FROM AUTHOR]

Effective dynamic scheduling of twin Automated Stacking Cranes (ASCs) is essential for improving the efficiency of automated storage yards. While Deep Reinforcement Learning (DRL) has shown promise in a variety of scheduling problems, the dynamic twin ASCs scheduling problem is challenging owing to its unique attributes, including the dynamic arrival of containers, sequence-dependent setup and potential ASC interference. A novel DRL method is proposed in this paper to minimize the ASC run time and traffic congestion in the yard. Considering the information interference from ineligible containers, dynamic masked self-attention (DMA) is designed to capture the location-related relationship between containers. Additionally, we propose local information complementary attention (LICA) to supplement congestion-related information for decision making. The embeddings grasped by the LICA-DMA neural architecture can effectively represent the system state. Extensive experiments show that the agent can learn high-quality scheduling policies. Compared with rule-based heuristics, the learned policies have significantly better performance with reasonable time costs. The policies also exhibit impressive generalization ability in unseen scenarios with various scales or distributions. [ABSTRACT FROM AUTHOR]

To adapt to the "fine" and "extensive" management characteristics of railway signal equipment operation and maintenance, achieving real-time and interactive monitoring of signal equipment operation status, and developing an integrated approach to equipment operation and maintenance, this paper takes a comprehensive management perspective. To create a lightweight BIM model, the Garland folding algorithm is utilized to simplify the IFC file format. Building on this approach, the data are divided based on building component division standards to obtain separate files containing geometric information and semantic attributes. The geometric information files are converted to a 3D Tiles format, combining BIM semantic attributes with semantic attribute files through an intermediate format. Dynamic data management is achieved by setting the octree space index structure in combination with a view-frustum culling algorithm. Then, the 3D Tiles target file is imported into the Cesium platform, and Node.js is used to achieve three-dimensional visualization of railway signal operation and maintenance. The proposed method is verified using an inbound signal as an example to assess its feasibility. The results demonstrate the potential of the proposed method to achieve stable integration between BIM equipment full lifecycle maintenance and GIS geographical space display. Railway signal equipment is endowed with comprehensive one-click information query functions for equipment positioning and spatial analysis, improving the efficiency and scientific decision-making level of equipment operation and maintenance. [ABSTRACT FROM AUTHOR]

Many real-world applications of the vehicle routing problem (VRP) are arising today, which range from physical resource planning to virtual resource management in the cloud computing domain. A common trait of these applications is usually the large scale size of problem instances, which require fast algorithms to generate solutions of acceptable quality. The basis for many VRP approaches is a heuristic which builds a candidate solution that may subsequently be improved by a local search procedure. Since there are many variants of the basic VRP model, specialised algorithms must be devised that take into account specific constraints and user-defined objective measures. Another factor is that the scheduling process may be carried out in dynamic conditions, where future information may be uncertain or unavailable or may be subject to change. When all of this is considered, there is a need for customised heuristics, devised for a specific problem variant, that could be used in highly dynamic environments. In this paper, we use genetic programming (GP) to evolve a suitable dispatching rule to build solutions for different objectives and classes of VRP problems, applicable in both dynamic and stochastic conditions. The results show great potential, since this method may be used for different problem classes and user-defined performance objectives. [ABSTRACT FROM AUTHOR]

In yard-crane scheduling problems, as loading operations take priority over unloading, the delivery sequence of unloading from the quaysides to the yard is uncertain. The delivery sequence changes may make crane scheduling more difficult. As a result, the crane operations schedules developed statically become suboptimal or even infeasible. In this paper, we propose a dynamic scheduling problem considering uncertain delivery sequences. A mixed-integer linear program is developed to assign tasks to cranes and minimize the makespan of crane operations. We propose an iterative solution framework in which the schedules are re-optimized whenever the delivery sequence change is revealed. A genetic algorithm is proposed to solve the problem, and a greedy algorithm is designed to re-optimize and update the solution. To make the updated solution take effect as soon as possible, regarding batch-based task assignment, the tasks in the scheduling period are divided into several batches. In this case, the instant requests arising from the delivery sequence change are added to corresponding batch tasks and re-optimized together with the tasks of this batch. In addition, a relaxation model is formulated to derive a lower bound for demonstrating the performance of the proposed algorithm. Experimental results show that the average gap between the algorithm and the lower bound does not exceed 5%. The greedy insertion algorithm can re-optimize the instant requests in time. Therefore, the proposed iterative re-optimization framework is feasible and has the advantages (necessity) of batch-based task assignment. [ABSTRACT FROM AUTHOR]

Equipment failure is a common problem in mining operations, resulting in significant delays and reductions in production efficiency. To address this problem, this paper proposes a dynamic scheduling model for underground metal mines under equipment failure conditions. The model aims to minimize the impact of equipment failures on production operations while avoiding extensive equipment changes. A case study of the southeastern mining area of the Chambishi Copper Mine is presented to demonstrate the effectiveness of the proposed model. The initial plan was generated using the multi-equipment task assignment model for the horizontal stripe pre-cut mining method. After equipment breakdown, the proposed model was used to reschedule the initial plan. Then, a comparative analysis was carried out. The results show that the proposed model effectively reduces the impact of equipment failures on production operations and improves overall mining execution at a low management cost. In general, the proposed model can assist schedulers in allocating equipment, coping with the disturbing effects of equipment failure, and improving mine production efficiency. [ABSTRACT FROM AUTHOR]

This paper deals with dynamic industry scheduling problem in agri-food production. The decision-making study in this paper is articulated around the management of perishable products under constrained resources. The scheduling of logistics operations is considered at the operational level. Two metaheuristics are proposed to solve dynamic scheduling under perturbations. The uncertainty sources considered in this study are the expiration date of product components and production delays. The proposed Genetic Algorithm (GA) and the Ant Colony Optimization Algorithm (ACO) take into consideration two objective functions: minimizing the makespan and reducing the number of perishable products. The algorithms are tested on a flow-shop agri-food system. [ABSTRACT FROM AUTHOR]

At present, discrete workshops demand higher transportation efficiency, but the traditional scheduling strategy of the logistics systems can no longer meet the requirements. In a transportation system with multiple automated guided vehicles (multi-AGVs), AGV path conflicts directly affect the efficiency and coordination of the whole system. At the same time, the uncertainty of the number and speed of AGVs will lead to excessive cost. To solve these problems, an AGVs Multi-Objective Dynamic Scheduling (AMODS) method is proposed which is based on the digital twin of the workshop. The digital twin of the workshop is built in the virtual space, and a two-way exchange and real-time control framework based on dynamic data is established. The digital twin system is adopted to exchange data in real time, create a real-time updated dynamic task list, determine the number of AGVs and the speed of AGVs under different working conditions, and effectively improve the efficiency of the logistics system. Compared with the traditional scheduling strategy, this paper is of practical significance for the scheduling of the discrete workshop logistics systems to improve the production efficiency, utilization rate of resources, and dynamic response capability. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new formulation of the multivehicle point-to-point network problem to be utilised in urban air mobility (UAM) vertiport-to-vertiport network operations. Vehicle routing problems (VRPs) and their variants have previously been studied and applied in real-world situations, but these problems require additional depot locations, and not all the vehicles can travel to all the locations. In UAM operations, additional depot locations may not be required, and all vehicles can travel to all locations, meaning that existing routing problems are not suitable for application to the management of UAMs. Therefore, we propose a new formulation for UAM vertiport-to-vertiport operation by introducing new constraints. In addition, we integrate dynamic scheduling with the flight mission by controlling cruise speed and waiting in each UAM at each vertiport location to generate an arrival and departure schedule for different vertiports that can avoid collisions and increase the number of vehicles. A computational experiment is conducted using an MILP model, and the results show that although our formulation satisfies the problem definition, the computation time increases exponentially with an increase in the problem size. A case study is conducted in the Seoul area involving five vertiports, with 10- and 15-vehicle scenarios studied. This case study shows that the cruise speed variable is active only for the lower and upper bounds under dynamic scheduling, whereas the waiting time variable can be controlled between user-defined limits that can be applied to the management of vertiport-to-vertiport UAM operations. [ABSTRACT FROM AUTHOR]

Interbay Automated Material Handling Systems (AMHS) are widely adopted especially in Semiconductor Wafer Fabrication Systems (SWFS). The dispatching method plays a major role in the control of AMHS. This paper proposes an efficient multi-objective dynamic dispatching method which will dynamically adjust vehicle-load assignments according to the real-time situation of the system. A multi-objective cost function with variable weights is established, taking into account various performance indices (i.e., transport time, throughput, cycle time, vehicle utilization, movement, and waiting time), and the corresponding mathematical model is formulated. Then, in order to obtain the suitable weights according to the real-time condition, an advanced method is developed based on fuzzy theory. After that, a Hungarian algorithm is adopted to solve the model. Finally, simulations are conducted to validate the proposed method. The results demonstrate that it has better comprehensive performance compared to the previous dispatching methods. [ABSTRACT FROM AUTHOR]

Production scheduling is the key to manufacturing process decision support, which directly affects the efficiency and competitiveness of enterprises. The production process of discrete workshops is complex and changeable, and it is usually difficult to make adjustments quickly and accurately in response to disturbance events. In this paper, a workshop production scheduling method based on digital twin is proposed and applied to the manufacturing workshop of an aerospace factory. Combined with the advantages of real-time virtual real interaction fusion of digital twin technology, the dynamic scheduling problem under fault disturbance factors is studied. A high-fidelity digital twin workshop is established to realize the mapping and interaction between the real production and the virtual factory. Based on the vibration data of machine tool spindle, a fault prediction method of learning vector quantization neural network is proposed. The dynamic scheduling strategy of workshop production based on digital twin is constructed and compared with the scheduling results without digital twin under fault disturbance. The results show that the scheduling method based on digital twin can effectively deal with disturbances and improve workshop productivity. This study can be used for the application of digital twin and production scheduling in practical factories. [ABSTRACT FROM AUTHOR]

In this work, we seek to design a model that contributes to the study and resolution of a multi-objective rescheduling problem in dynamic permutation flow shop contexts. In this type of problem, where the objectives can be valued in heterogeneous units, the difficulty of achieving an optimal solution leads to finding a set of non-dominated efficient solutions (also called Pareto front). On the other hand, we will also consider the potential appearance of disruptions in planned scheduling (such as machine breakdowns or arrival of new priority jobs) that require a rapid re-planning of the aforementioned scheduling. In this paper, a hybrid dynamic non-dominated sorting genetic II metaheuristic (HDNSGA-II) is proposed to find the optimal Pareto front. The algorithm is applied to a benchmark already tested in previous studies, defined by three conflicting objective functions (makespan, total weighted tardiness, and stability) and three different types of disruption (machine breakdowns, incorporation of new jobs, and modifications in process times). According to the statistical comparison performed, the HDNSGA-II algorithm performs better in the designed environment, especially in larger problems. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles are becoming promising platforms for disaster relief, such as providing emergency communication services in wireless sensor networks, delivering some living supplies, and mapping for disaster recovery. Dynamic task scheduling plays a very critical role in coping with emergent tasks. To solve the multi-UAV dynamic task scheduling, this paper constructs a multi-constraint mathematical model for multi-UAV dynamic task scheduling, involving task demands and platform capabilities. Three objectives are considered, which are to maximize the total profit of scheduled tasks, to minimize the time consumption, and to balance the number of scheduled tasks for multiple UAVs. The multi-objective problem is converted into single-objective optimization via the weighted sum method. Then, a novel dynamic task scheduling method based on a hybrid contract net protocol is proposed, including a buy-sell contract, swap contract, and replacement contract. Finally, extensive simulations are conducted under three scenarios with emergency tasks, pop-up obstacles, and platform failure to verify the superiority of the proposed method. [ABSTRACT FROM AUTHOR]

Various factors and constraints should be considered when developing a manufacturing production schedule, and such a schedule is often based on rules. This paper develops a composite dispatching rule based on heuristic rules that comprehensively consider various factors in a semiconductor production line. The composite rule is obtained by exploring various states of a semiconductor production line (machine status, queue size, etc.), where such indicators as makespan and equipment efficiency are used to judge performance. Amodel of the response surface, as a function of key variables, is then developed to find the optimized parameters of a composite rule for various production states. Furthermore, dynamic scheduling of semiconductor manufacturing is studied based on support vector regression (SVR). This approach dynamically obtains a composite dispatching rule (i.e., parameters of the composite dispatching rule) that can be used to optimize production performance according to real-time production line state. Following optimization, the proposed dynamic scheduling approach is tested in a real semiconductor production line to validate the effectiveness of the proposed composite rule set. [ABSTRACT FROM AUTHOR]

Massive computational resources are required by a booming number of artificial intelligence (AI) services in the communication network of the smart grid. To alleviate the computational pressure on data centers, edge computing first network (ECFN) can serve as an effective solution to realize distributed model training based on data parallelism for AI services in smart grid. Due to AI services with diversified types, an edge data center has a changing workload in different time periods. Selfish edge data centers from different edge suppliers are reluctant to share their computing resources without a rule for fair competition. AI services-oriented dynamic computational resource scheduling of edge data centers affects both the economic profit of AI service providers and computational resource utilization. This letter mainly discusses the partition and distribution of AI data based on distributed model training and dynamic computational resource scheduling problems among multiple edge data centers for AI services. To this end, a mixed integer linear programming (MILP) model and a Deep Reinforcement Learning (DRL)-based algorithm are proposed. Simulation results show that the proposed DRL-based algorithm outperforms the benchmark in terms of profit of AI service provider, backlog of distributed model training tasks, running time and multi-objective optimization. [ABSTRACT FROM AUTHOR]

Volunteer computing (VC) is a distributed computing paradigm, which provides unlimited computing resources in the form of donated idle resources for many large-scale scientific computing applications. Task scheduling is one of the most challenging problems in VC. Although, dynamic scheduling problem with deadline constraint has been extensively studied in prior studies in the heterogeneous system, such as cloud computing and clusters, these algorithms can't be fully applied to VC. This is because volunteer nodes can get offline whenever they want without taking any responsibility, which is different from other distributed computing. For this situation, this paper proposes a dynamic task scheduling algorithm for heterogeneous VC with deadline constraint, called deadline preference dispatch scheduling (DPDS). The DPDS algorithm selects tasks with the nearest deadline each time and assigns them to volunteer nodes (VN), which solves the dynamic task scheduling problem with deadline constraint. To make full use of resources and maximize the number of completed tasks before the deadline constraint, on the basis of the DPDS algorithm, improved dispatch constraint scheduling (IDCS) is further proposed. To verify our algorithms, we conducted experiments, and the results show that the proposed algorithms can effectively solve the dynamic task assignment problem with deadline constraint in VC. [ABSTRACT FROM AUTHOR]

The ready-mixed concrete delivery (RMC) problem is a scheduling problem, where multiple trucks deliver concrete to order sites abiding by hard constraints in a dynamic environment. It is an NP-hard problem, impractical to solve using exhaustive methods. Thus, it requires heuristic-based approaches for generating sub-optimal schedules. Due to its distributed nature, we address this problem using a decentralised, scalable, cooperative MAS (multiagent system) that dynamically generates schedules. We explore the impact of teamwork by trucks on schedule optimisation. This work illustrates two novel approaches that address the dynamic RMC problem; a Delegate MAS approach and a team-extended approach. We present an empirical study, comparing our novel approaches with existing ones. The evaluation is performed by classifying the RMC case study scenarios into unique stress, scale, and dynamism characteristics. With 40% to 70% improvement over different metrics, the results show that both approaches generate better schedules, and using agent teams augments the performance. Thus, such decentralized MAS with the appropriate coordination approach and teamwork can be used for solving constrained dynamic scheduling problems. [ABSTRACT FROM AUTHOR]

Software-defined Networking (SDN) and Data Center Network (DCN) are receiving considerable attention and eliciting widespread interest from both academia and industry. When the traditionally shortest path routing protocol among multiple data centers is used, congestion will frequently occur in the shortest path link, which may severely reduce the quality of network services due to long delay and low throughput. The flexibility and agility of SDN can effectively ameliorate the aforementioned problem. However, the utilization of link resources across data centers is still insufficient, and has not yet been well addressed. In this paper, we focused on this issue and proposed an intelligent approach of real-time processing and dynamic scheduling that could make full use of the network resources. The traffic among the data centers could be classified into different types, and different strategies were proposed for these types of real-time traffic. Considering the prolonged occupation of the bandwidth by malicious flows, we employed the multilevel feedback queue mechanism and proposed an effective congestion control algorithm. Simulation experiments showed that our scheme exhibited the favorable feasibility and demonstrated a better traffic scheduling effect and great improvement in bandwidth utilization across data centers. [ABSTRACT FROM AUTHOR]

The implementation of quality processes is essential for an academic setting to meet the standards of different accreditation bodies. However, processes are complex because they involve several steps and several entities. Manual implementation (i.e., using paperwork), which many institutions use, has difficulty following up the progress and closing the cycle. It becomes more challenging when more processes are in place, especially when an academic department runs more than one program. Having n programs per department means that the work is replicated n times. Our proposal in this study is to use the concept of the Tomasulo algorithm to schedule all processes of an academic institution dynamically. Because of the similarities between computer tasks and the processes of workplaces, applying this method enhances work efficiencies and reduces efforts. Further, the method provides a mechanism to secure the integrity of the reports of these processes. In this paper, we provided an educational institution case study to understand the mechanism of this method and how it can be applied in an actual workplace. The case study included operational activities that are implemented to assure the program's quality. [ABSTRACT FROM AUTHOR]

Cognitive radio (CR), as a concept based on the ability to detect and share the unutilised spectrum, has been envisioned as a promising candidate to improve the efficiency of frequency spectrum assignments. For the realisation of the CR concept, energy detection (ED), as one of the available spectrum sensing methods, is broadly considered because of its low computational complexity and implementation costs. Due to the vast usage of the orthogonal frequency division multiplexing (OFDM) technique in contemporary communication systems, the ED of OFDM signals in the CR networks has become important for practical realisation. Since the ED accuracy of the OFDM signals can be improved by the sensing threshold adaptation, this paper surveys the impact of noise variations and dynamic threshold (DT) adaptation on the ED performance of OFDM signals. Analyses were performed by the simulation of the ED related to OFDM signals transmitted in the margin or rate adaptive and combined margin and rate adaptive OFDM systems. The results obtained through extensive simulations provide fundamental insights into how different factors, including the transmission power, the signal to noise ratio, the false alarm probability and the sample quantity, affect the ED efficiency. Comprehensive analyses of the obtained results indicate the main ED weaknesses and how the appropriate selection of analysed factors can enhance the ED processes for different OFDM systems. The observed ED weaknesses were further thoroughly surveyed, and the open issues and challenges related to the enhancement of the main ED limitations have been elaborated. The presented survey results can serve as a basis for the improvement of a broadly accepted ED method in CR networks. [ABSTRACT FROM AUTHOR]

An important element in the integration of the fourth industrial revolution is the development of efficient algorithms to deal with dynamic scheduling problems. In dynamic scheduling, jobs can be admitted during the execution of a given schedule, which necessitates appropriately planned rescheduling decisions for maintaining a high level of performance. In this paper, a dynamic case of the multiprocessor open shop scheduling problem is addressed. This problem appears in different contexts, particularly those involving diagnostic operations in maintenance and health care industries. Two objectives are considered simultaneously—the minimization of the makespan and the minimization of the mean weighted flow time. The former objective aims to sustain efficient utilization of the available resources, while the latter objective helps in maintaining a high customer satisfaction level. An exact algorithm is presented for generating optimal Pareto front solutions. Despite the fact that the studied problem is NP-hard for both objectives, the presented algorithm can be used to solve small instances. This is demonstrated through computational experiments on a testbed of 30 randomly generated instances. The presented algorithm can also be used to generate approximate Pareto front solutions in case computational time needed to find proven optimal solutions for generated sub-problems is found to be excessive. Furthermore, computational results are used to investigate the characteristics of the optimal Pareto front of the studied problem. Accordingly, some insights for future metaheuristic developments are drawn. [ABSTRACT FROM AUTHOR]

Intelligent manufacturing is a challenging and compelling topic in Industry 4.0. Many computer vision (CV)-based applications have attracted widespread interest from researchers and industries around the world. However, it is difficult to integrate visual recognition algorithms with industrial control systems. The low-level devices are controlled by traditional programmable logic controllers (PLCs) that cannot realize data communication due to different industrial control protocols. In this article, we develop a multi-crane visual sorting system with cloud PLCs in a 5G environment, in which deep convolutional neural network (CNN)-based character recognition and dynamic scheduling are designed for materials in intelligent manufacturing. First, an YOLOv5-based algorithm is applied to locate the position of objects on the conveyor belt. Then, we propose a Chinese character recognition network (CCRNet) to significantly recognize each object from the original image. The position, type, and timestamp of each object are sent to cloud PLCs that are virtualized in the cloud to replace the function of traditional PLCs in the terminal. After that, we propose a dynamic scheduling method to sort the materials in minimum time. Finally, we establish a real experimental platform of a multi-crane visual sorting system to verify the performance of the proposed methods. [ABSTRACT FROM AUTHOR]

Various production disturbances occurring in the flexible job shop production process may affect the production of the workshop, some of which may lead to the prolongation of production completion time. Therefore, a flexible job shop dynamic scheduling method based on digital twins is proposed and a dynamic scheduling framework is constructed. Compared with the traditional workshop, the digital twin-based flexible job shop can upload the relevant production data of the physical workshop to the data management center in real time, and after fusion processing the data can work cooperatively with the upper application system. Taking the dynamic disturbance of rush order insertion as an example, the dynamic scheduling of insertion order is realized based on the dynamic scheduling framework, and then the production efficiency is improved. To achieve the shortest completion time, a mathematical model for dynamic scheduling optimization is established and a genetic algorithm (GA) is applied to solve the model. Finally, a practical case is applied to show that the completion time of this algorithm is reduced by 35%, which verifies the feasibility of the proposed dynamic scheduling method. [ABSTRACT FROM AUTHOR]

The combine harvester is the main machine for fieldwork during the harvest season. When the harvester fails and cannot continue to work, this indirectly affects the harvest time and the yield in the field. The emergency maintenance service of agricultural machinery can be optimized through the dynamic planning of harvester maintenance tasks, using the operation and maintenance platform. According to the scene, a priority scheme for the operation and maintenance tasks, based on the improved Q-learning algorithm, was proposed. The continuous approximation capability of the model was improved by using the BP neural network algorithm and the Q function value, in iterations, was updated continuously. At the same time, the improved TOPSIS method, based on Mahalanobis distance, was used to calculate the closeness of each harvester maintenance task, so as to determine the priority of the equipment maintenance tasks. An operation and maintenance service platform for combine harvesters was developed based on the B/S architecture, with the goal of minimizing the operation and maintenance costs and improving the tasks' complete efficiency. In this research process, dynamic scheduling rules were formulated. Operation and maintenance resources were optimized and rationally allocated through dynamic optimization scheduling methods, and feasible solution information was generated from the operation and maintenance service platform. Finally, the actual data from the enterprise were used for verification and analysis. The verification showed the following: through a comparison of algorithm performance, it was seen that the improved BP-Q-Learning algorithm can quickly find the operation and maintenance scheduling scheme in the maintenance scheduling; the priority rules can improve the efficiency of task execution, to a certain extent; the cost of the tasks' execution can be significantly reduced; and the maintenance distance can be shortened. This research has reference significance for the formulation and optimization of agricultural machinery maintenance for cross-regional operations. [ABSTRACT FROM AUTHOR]

In smart cities, relief items distribution is a complex task due to the factors such as incomplete information, unpredictable exact demand, lack of resources, and causality levels, to name a few. With the development of Internet of Things (IoT) technologies, dynamic data update provides the scope of distribution schedule to adopt changes with updates. Therefore, the dynamic relief items distribution schedule becomes a need to generate humanitarian supply chain schedules as a smart city application. To address the disaster data updates in different time periods, a dynamic optimised model with a sliding time window is proposed that defines the distribution schedule of relief items from multiple supply points to different disaster regions. The proposed model not only considers the details of available resources dynamically but also introduces disaster region priority along with transportation routes information updates for each scheduling time slot. Such an integrated optimised model delivers an effective distribution schedule to start with and updates it for each time slot. A set of numerical case studies is formulated to evaluate the performance of the optimised scheduling. The dynamic updates on the relief item demands' travel path, causality level and available resources parameters have been included as performance measures for optimising the distributing schedule. The models have been evaluated based on performance measures to reflect disaster scenarios. Evaluation of the proposed models in comparison to the other perspective static and dynamic relief items distribution models shows that adopting dynamic updates in the distribution model cover most of the major aspects of the relief items distribution task in a more realistic way for post-disaster relief management. The analysis has also shown that the proposed model has the adaptability to address the changing demand and resources availability along with disaster conditions. In addition, this model will also help the decision-makers to plan the post-disaster relief operations in more effective ways by covering the updates on disaster data in each time period. [ABSTRACT FROM AUTHOR]

With the rapid development of Industrial 4.0, the modern manufacturing system has been experiencing profoundly digital transformation. The development of new technologies helps to improve the efficiency of production and the quality of products. However, for the increasingly complex production systems, operational decision making encounters more challenges in terms of having sustainable manufacturing to satisfy customers and markets' rapidly changing demands. Nowadays, rule-based heuristic approaches are widely used for scheduling management in production systems, which, however, significantly depends on the expert domain knowledge. In this way, the efficiency of decision making could not be guaranteed nor meet the dynamic scheduling requirement in the job-shop manufacturing environment. In this study, we propose using deep reinforcement learning (DRL) methods to tackle the dynamic scheduling problem in the job-shop manufacturing system with unexpected machine failure. The proximal policy optimization (PPO) algorithm was used in the DRL framework to accelerate the learning process and improve performance. The proposed method was testified within a real-world dynamic production environment, and it performs better compared with the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

The localization of continuous objects and the scheduling of resources are challenging issues in wireless sensor networks (WSNs). Due to the irregular shape of the continuous target area and the sensor deployment in WSNs, the sensor data are always discrete and sparse, and most network resources are also limited by the node energy. To achieve faster detection and tracking of continuous objects, we propose a convolution-based continuous object localization algorithm (named CCOL). Moreover, we implement the idea of greedy and dynamic programming to design an energy-saving and efficient strategy model (named MSSM) to respond to emergencies caused by multiple continuous targets in most specific WSNs. The simulation experiments demonstrate that CCOL is superior to other localization algorithms in terms of time complexity and execution performance. Furthermore, the feasibility of the multinode scheduling strategy is verified by setting different mobile nodes to respond to the target area in certain green WSNs. [ABSTRACT FROM AUTHOR]

Due to poor predictability of resources and difficulty in perception of task execution status, traditional Automatic Guide Vehicle (AGV) scheduling systems need a lot of extra time in the charging process. To solve this problem, a digital twin-based dynamic AGV scheduling (DTDAS) method is proposed, including four functions, namely the knowledge support system, the scheduling model, the scheduling optimization, and the scheduling simulation. With the features of virtual reality data interaction, symbiosis, and fusion from the digital twin technology, the proposed DTDAS method can solve the AGV charging problem in the AGV scheduling system, effectively improving the operating efficiency of the workshop. An AGV scheduling process in a discrete manufacturing workshop is taken as a case study to verify the effectiveness of the proposed method. The results show that, compared with the traditional AGV scheduling method, the DTDAS method proposed in this article can reduce makespan 10.7% and reduce energy consumption by 1.32%. [ABSTRACT FROM AUTHOR]

In order to improve the horizontal transportation efficiency of the terminal Automated Guided Vehicles (AGVs), it is necessary to focus on coordinating the time and space synchronization operation of the loading and unloading of equipment, the transportation of equipment during the operation, and the reduction in the completion time of the task. Traditional scheduling methods limited dynamic response capabilities and were not suitable for handling dynamic terminal operating environments. Therefore, this paper discusses how to use delivery task information and AGVs spatiotemporal information to dynamically schedule AGVs, minimizes the delay time of tasks and AGVs travel time, and proposes a deep reinforcement learning algorithm framework. The framework combines the benefits of real-time response and flexibility of the Convolutional Neural Network (CNN) and the Deep Deterministic Policy Gradient (DDPG) algorithm, and can dynamically adjust AGVs scheduling strategies according to the input spatiotemporal state information. In the framework, firstly, the AGVs scheduling process is defined as a Markov decision process, which analyzes the system's spatiotemporal state information in detail, introduces assignment heuristic rules, and rewards the reshaping mechanism in order to realize the decoupling of the model and the AGVs dynamic scheduling problem. Then, a multi-channel matrix is built to characterize space–time state information, the CNN is used to generalize and approximate the action value functions of different state information, and the DDPG algorithm is used to achieve the best AGV and container matching in the decision stage. The proposed model and algorithm frame are applied to experiments with different cases. The scheduling performance of the adaptive genetic algorithm and rolling horizon approach is compared. The results show that, compared with a single scheduling rule, the proposed algorithm improves the average performance of task completion time, task delay time, AGVs travel time and task delay rate by 15.63%, 56.16%, 16.36% and 30.22%, respectively; compared with AGA and RHPA, it reduces the tasks completion time by approximately 3.10% and 2.40%. [ABSTRACT FROM AUTHOR]

An important as well as challenging task in modern applications is the management and processing with very short delays of large data volumes. It is quite often, that the capabilities of individual machines are exceeded when trying to manage such large data volumes. In this regard, it is important to develop efficient task scheduling algorithms, which reduce the stream processing costs. What makes the situation more difficult is the fact that the applications as well as the processing systems are prone to changes during runtime: processing nodes may be down, temporarily or permanently, more resources may be needed by an application, and so on. Therefore, it is necessary to develop dynamic schedulers, which can effectively deal with these changes during runtime. In this work, we provide a fast and fair task migration policy while maintaining load balancing and low latency times. The experimental results have shown that our scheme offers better load balancing and reduces the overall latency compared to the state of the art strategies, due to the stepwise communication and the pipeline based processing it employs. [ABSTRACT FROM AUTHOR]

Featured Application: The dynamic scheduling research of carrier aircraft support operations in different missions involves multiple support resources (renewable resources include support operational crews and support equipment, non-renewable resources include oil, oxygen, nitrogen, hydraulic, power), complex scheduling process such as the operational activities that should satisfy serial and parallel constraint relationships, multiple constraints (renewable resources constraints, non-renewable resources constraints, operational space constraints). The efficient coordination of these resources can be described as a multi-resource constrained multi-project scheduling problem (MRCMPSP) under an uncertain environment. In this work, an integer programming mathematical model is established for carrier aircraft dynamic support scheduling to solve the non-deterministic polynomial-time hard (NP-hard) problem. A periodic and event-driven rolling horizon (RH) scheduling strategy that was inspired by the RH optimization method from predictive control technology is presented for the uncertain and dynamic environment. The RH strategy not only reduces the problem size, it also effectively adjusts the baseline scheduling in a reasonable computational time and avoids the unnecessary scheduling with effective resource allocation in the dynamic flight deck environment. The dual population genetic algorithm (DPGA) is designed to solve the large-scale scheduling problem. The computational results show that our approach can provide convenient guidance to carrier aircraft support and scheduling applications in the dynamic flight deck environment, and make better decisions regarding disruption on a real-time basis. The efficient scheduling of carrier aircraft support operations in the flight deck is important for battle performances. The supporting operations and maintenance processes involve multiple support resources, complex scheduling process, and multiple constraints; the efficient coordination of these processes can be considered a multi-resource constrained multi-project scheduling problem (MRCMPSP), which is a complex non-deterministic polynomial-time hard (NP-hard) problem. The renewable resources include the operational crews, resource stations, and operational spaces, and the non-renewable resources include oil, gas, weapons, and electric power. An integer programming mathematical model is established to solve this problem. A periodic and event-driven rolling horizon (RH) scheduling strategy inspired by the RH optimization method from predictive control technology is presented for the dynamic scheduling environment. The periodic horizon scheduling strategy can track the changes of the carrier aircraft supporting system, and the improved event-driven mechanism can avoid unnecessary scheduling with effective resource allocation under uncertain conditions. The dual population genetic algorithm (DPGA) is designed to solve the large-scale scheduling problem. The activity list encoding method is proposed, and a new adaptive crossover and mutation strategy is designed to improve the global exploration ability. The double schedule for leftward and rightward populations is integrated into the genetic process of alternating iterations to improve the convergence speed and decrease the computation amount. The computational results show that our approach is effective at solving the scheduling problem in the dynamic environment, as well as making better decisions regarding disruption on a real-time basis. [ABSTRACT FROM AUTHOR]

Abstract: Infrastructure as a service with desktops (DIaaS) based on the extensible mark-up language (XML) is herein proposed to utilize surplus resources. DIaaS is a traditional surplus-resource integrated management technology. It is designed to provide fast work distribution and computing services based on user service requests as well as storage services through desktop-based distributed computing and storage resource integration. DIaaS includes a nondisruptive resource service and an auto-scalable scheme to enhance the availability and scalability of intra-cloud computing resources. A performance evaluation of the proposed scheme measured the clustering performance time for surplus resource utilization. The results showed improvement in computing and storage services in a connection of at least two computers compared to the traditional method for high-availability measurement of nondisruptive services. Furthermore, an artificial server error environment was used to create a clustering delay for computing and storage services and for nondisruptive services. It was compared to the Hadoop distributed file system (HDFS). [ABSTRACT FROM AUTHOR]

Oblique photogrammetry models are indispensable for implementing digital twins of cities. Geographic information system researchers have proposed plenty of methods to load and visualize these city-scaled scenes. However, when the area viewed changes quickly in real-time rendering, current methods still require excessive GPU calculation and memory occupation. In this study, we propose a data organization method in which we merged all quadtrees and used a binary encoding method to encode nodes in a merged tree so that the parent–child relationship between the tree nodes could be calculated using rapid binary operations. After that, we developed a strategy to cancel the loading of redundant nodes based on the parent–child relationship, which helped to reduce the hard disk loading time and the amount of memory occupied in visualization. Moreover, we introduced a parameter to measure the area of the triangle mesh per pixel to achieve unified data scheduling under different production standards. We implemented our method based on Unreal Engine (UE), and three experiments were designed to illustrate the advantages of our methods in index acceleration, frame time, and memory reduction. The results show that our methods can significantly improve visualization fluency and reduce memory usage. [ABSTRACT FROM AUTHOR]

Dynamic scheduling problems have been receiving increasing attention in recent years due to their practical implications. To realize real-time and the intelligent decision-making of dynamic scheduling, we studied dynamic permutation flowshop scheduling problem (PFSP) with new job arrival using deep reinforcement learning (DRL). A system architecture for solving dynamic PFSP using DRL is proposed, and the mathematical model to minimize total tardiness cost is established. Additionally, the intelligent scheduling system based on DRL is modeled, with state features, actions, and reward designed. Moreover, the advantage actor-critic (A2C) algorithm is adapted to train the scheduling agent. The learning curve indicates that the scheduling agent learned to generate better solutions efficiently during training. Extensive experiments are carried out to compare the A2C-based scheduling agent with every single action, other DRL algorithms, and meta-heuristics. The results show the well performance of the A2C-based scheduling agent considering solution quality, CPU times, and generalization. Notably, the trained agent generates a scheduling action only in 2.16 ms on average, which is almost instantaneous and can be used for real-time scheduling. Our work can help to build a self-learning, real-time optimizing, and intelligent decision-making scheduling system. [ABSTRACT FROM AUTHOR]

To improve efficiency and reduce the total scheduling cost of the public bicycle system (PBS), dynamic scheduling based on the predicted inventory variation rate (DS-PIVR) is proposed. Regarding a station in the PBS as an inventory system, its inventory variation rate during the scheduling period and its inventory rate at the end of the scheduling period were predicted based on the stationary Markov process condition. A mixed integer programming (MIP) model, whose objective is to minimize the total scheduling distance, was established to describe the dynamic scheduling problem (DSP). Results from Boston and Washington D.C. PBSs show that, when compared to the dynamic scheduling based on the rolling horizon (DS-RH), the DS-PIVR method could at most shorten the routing distance by 62.25% (for Boston) and 74.7% (for Washington D.C.) among all scheduling areas, and could at most shorten the total routing distance for the whole PBS by 21.06% (for Boston) and 17.26% (for Washington D.C.). Moreover, the DS-PIVR method makes the repositioning vehicle journey only once and keeps the inventory rate of each station in balance during the scheduling period. Furthermore, the DS-PIVR method provides a promising reference to improve the operation efficiency by reducing the scheduling cost and the quality of service by satisfying the users' demand in time during the rush hours for the PBS operators. [ABSTRACT FROM AUTHOR]

To make full use of distributed energy resources to meet load demand, this study aggregated wind power plants (WPPs), photovoltaic power generation (PV), small hydropower stations (SHSs), energy storage systems (ESSs), conventional gas turbines (CGTs) and incentive-based demand responses (IBDRs) into a virtual power plant (VPP) with price-based demand response (PBDR). Firstly, a basic scheduling model for the VPP was proposed in this study with the objective of the maximum operation revenue. Secondly, a risk aversion model for the VPP was constructed based on the conditional value at risk (CVaR) method and robust optimization theory considering the operating risk from WPP and PV. Thirdly, a solution methodology was constructed and three cases were considered for comparative analyses. Finally, an independent micro-grid on an industrial park in East China was utilized for an example analysis. The results show the following: (1) the proposed risk aversion scheduling model could cope with the uncertainty risk via a reasonable confidence degree β and robust coefficient Γ. When Γ ≤ 0.85 or Γ ≥ 0.95, a small uncertainty brought great risk, indicating that the risk attitude of the decision maker will affect the scheduling scheme of the VPP, and the decision maker belongs to the risk extreme aversion type. When Γ ∈ (0.85, 0.95), the decision-making scheme was in a stable state, the growth of β lead to the increase of CVaR, but the magnitude was not large. When the prediction error e was higher, the value of CVaR increased more when Γ increased by the same magnitude, which indicates that a lower prediction accuracy will amplify the uncertainty risk. (2) when the capacity ratio of (WPP, PV): ESS was higher than 1.5:1 and the peak-to-valley price gap was higher than 3:1, the values of revenue, VaR, and CVaR changed slower, indicating that both ESS and PBDR can improve the operating revenue, but the capacity scale of ESS and the peak-valley price gap need to be set properly, considering both economic benefits and operating risks. Therefore, the proposed risk aversion model could maximize the utilization of clean energy to obtain higher economic benefits while rationally controlling risks and provide reliable decision support for developing optimal operation plans for the VPP. [ABSTRACT FROM AUTHOR]