Over the past few decades, aircraft Ground Handling Operations (GHO) have been investigated by numerous researchers. Some aspects of GHO have been more focused on than others due to their importance in the GH processes. For instance, GHO performance has been tackled from different perspectives while workers and vehicles allocation suffer from the lack of research in the area. This paper is a literary review of the research that has been conducted in different areas of GHO. It sheds light on GHO performance, resource allocation and scheduling, operations scheduling, vehicle routing, and workers and vehicles allocation.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.

Cloud computing refers to applications delivered as services over the Internet. Cloud systems employ policies that are inherently dynamic in nature and that depend on temporal conditions defined in terms of external events, such as the measurement of bandwidth, use of hosts, intrusion detection or specific time events. In this paper, we investigate an optimized resource management scheme named v-Mapper. The basic premise of v-Mapper is to exploit application-awareness concepts using software-defined networking (SDN) features. This paper makes three key contributions to the field: (1) We propose a virtual machine (VM) placement scheme that can effectively mitigate the VM placement issues for data-intensive applications; (2) We propose a validation scheme that will ensure that a service is entertained only if there are sufficient resources available for its execution and (3) We present a scheduling policy that aims to eliminate network load constraints. An evaluation was carried out with various benchmarks and demonstrated that v-Mapper shows improved performance over other state-of-the-art approaches in terms of average task completion time, service delay time and bandwidth utilization. Given the growing importance of supporting large-scale data processing and analysis in datacentres, the v-Mapper system has the potential to make a positive impact in improving datacentre performance in the future.

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. A model 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. Further, 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.

Although energy management of a microgrid is generally performed using a day-ahead scheduling method, its effectiveness has been questioned by the research community due to the existence of high uncertainty in renewable power generation, power demand and electricity market. As a result, real-time energy management schemes are recently developed to minimise the operating cost of a microgrid while high uncertainty presents in the network. This paper develops modified particle swarm optimisation (MPSO) algorithms to solve optimisation problems of energy management schemes for a community microgrid and proposes a scheduling approach after taking into consideration high uncertainty to effectively minimise the operational cost of the microgrid. The optimisation problems are formulated for real-time and scheduling approaches, and solution methods are developed to solve the problems. It is observed that the scheduling program demonstrates superior performance in all the cases, including uncertainty in prediction, as compared to the other energy management approaches, although solutions have significant deviations due to prediction errors.

In this work, an algorithm for the scheduling of household appliances to reduce the energy cost and the peak-power consumption is proposed. The system architecture of a home energy management system (HEMS) is presented to operate the appliances. The dynamics of thermal and non-thermal appliances is represented into state-space model to formulate the scheduling task into a mixed-integer-linear-programming (MILP) optimization problem. Model predictive control (MPC) strategy is used to operate the appliances in real-time. The HEMS schedules the appliances in a dynamic manner without any a priori knowledge of the load-consumption pattern. At the same time, HEMS responds to the real-time electricity market and the external environmental conditions (solar radiation, ambient temperature etc). Simulation results exhibit the benefits of proposed HEMS by showing the reduction of up to 47% in electricity cost and up to 48% in peak power consumption.

This paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the Peak Demand Minimization problem and has been previously shown to be NP-hard. Our results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.

A real-time two-way direct load control (TWDLC) of central air-conditioning chillers in wide area is proposed to provide demand response. The proposed TWDLC scheme is designed to optimize the load shedding ratio of every customer under control to ensure the target load to be shed is met at every scheduling period. In order to overcome the load reduction uncertainties of TWDLC, an innovative solution is proposed by applying a certain degree of loosening on the constraint of the actual shed load. Fuzzy linear programming is utilized to solve the optimization problem with fuzzy constraints. The proposed fuzzy linear programming problem is solved by delicately transforming it into a regular liner programming problem. A selection scheme used to obtain the feasible candidates set for load shedding at every sampling interval of TWDLC is also designed along with the fuzzy linear programming.

Abstract: As the policies and regulations currently in place concentrate on environmental protection and greenhouse gas reduction, we are steadily witnessing a shift in the transportation industry towards electromobility. There are, though, several issues that need to be addressed to encourage the adoption of EVs at a larger scale. To this end, we propose a solution capable of addressing multiple EV charging scheduling issues, such as congestion management, scheduling a charging station in advance, and allowing EV drivers to plan optimized long trips using their EVs. The smart charging scheduling system we propose considers a variety of factors such as battery charge level, trip distance, nearby charging stations, other appointments, and average speed. Given the scarcity of data sets required to train the Reinforcement Learning algorithms, the novelty of the recommended solution lies in the scenario simulator, which generates the labelled datasets needed to train the algorithm. Based on the generated scenarios, we created and trained a neural network that uses a history of previous situations to identify the optimal charging station and time interval for recharging. The results are promising and for future work we are planning to train the DQN model using real-world data.

The widespread adoption of electromobility constitutes one of the measures designed to reduce air pollution caused by traditional fossil fuels. However, several factors are currently impending this process, ranging from insufficient charging infrastructure, battery capacity, long queueing and charging time, to psychological factors. On top of range anxiety, the frustration of the EV drivers is further fueled by the lack the uncertainty of finding an available charging point on their route. To address this issue, we propose a solution that comes to bypass the limitations of the Reserve now function of the OCPP standard, enabling drivers to make charging reservations for the upcoming days, especially when planning a longer trip. We created an algorithm that generates reservation intervals based on the charging station's reservation and transaction history. Subsequently, we ran a series of test cases that yielded promising results, with no overlapping reservations.

It was recently studied how to achieve the optimal degrees of freedom (DoF) in a multi-antenna full-duplex system with partial channel state information (CSI). In this paper, we revisit the DoF of a multiple-antenna full-duplex system using opportunistic transmission under the partial CSI, in which a full-duplex base station having M transmit antennas and M receive antennas supports a set of half-duplex mobile stations (MSs) having a single antenna each. Assuming no self-interference, we present a new hybrid opportunistic scheduling method that achieves the optimal sum DoF under an improved user scaling law. It is shown that the optimal sum DoF of 2M is asymptotically achievable provided that the number of MSs scales faster than SNR^M, where SNR denotes the signal-to-noise ratio. This result reveals that in our full-duplex system, better performance on the user scaling law can be obtained without extra CSI, compared to the prior work that showed the required user scaling condition (i.e., the minimum number of MSs for guaranteeing the optimal DoF) of SNR^2M−1.

The resource allocation for tasks in heterogeneous distributed system is a well known NP-hard problem. For the sake of making the makespan is minimized, it is hard to distribute the tasks to proper processors. The problem is even more complex and challenging when the processors have unavailable time and the tasks type are various. This paper investigates a resource allocation problem for hybrid tasks comprising both divisible and bag-of-tasks(BoT) in heterogeneous distributed system when the processors has unavailable time. First, the mathematical model, which minimizes the makespan of the hybrid tasks when the processors have unavailable time, is established. Second, we propose a scheduling algorithm referred to as bag-of-tasks allocate-pull and divisible task allocation (BoTAPDTA) algorithm for handling hybrid tasks on heterogeneous distributed systems. In addition, to solving the optimization model efficiently, a generic algorithm(GA) is proposed. For the sake of reducing the search space and solving the optimization model effectively, a two step scheduling algorithm(TSGA), which first allocate bag-of-tasks(BoT) using generic algorithm and then assign divisible task to processors like BoTAPDTA, is designed. Finally, numerical simulation experiments are conducted, and experimental results indicate the effectiveness of the proposed model and algorithm.

The present era of the Internet of Things (IoT) having intelligent functionalities in solving problems pertaining to realtime mission-critical systems has brought an immense revolution in diverse fields including healthcare and navigation systems. However, to the best of our knowledge, the potential of IoT has not been fully exploited yet in the field of the energy sector. We argue that there is an immense need to shift the traditional mission-critical electric power system architecture to IoT-based fully orchestrated architecture in order to increase efficiency, as billions of investment is reserved for the energy sector globally. Since network orchestration deals with auomating the interaction between multiple components involved to execute a particular service, therefore, scheduling the relevant processes within strict deadlines becomes the core pillar of the architecture. The mission-critical systems with urgent task execution often suffer from issues of missing task deadlines. In this study, we present a novel IoT task orchestration architecture for efficient energy management of a nanogrid system that focuses on minimizing the use of nonrenewable energy resources and maximizing the use of renewable energy resources. Moreover, major components of IoT task orchestration such as task mapping and task scheduling are also enhanced using NLP and PSO optimization modules. The proposed task scheduling algorithm incorporates the optimized surplus time, and efficiently executes the energy management-related tasks contemplating to their types. The study utilizes sensors to obtain data from physical IoT devices, including photovoltaic (PV), Energy Storage System (ESS), and diesel generator (DG). The performance of the proposed model is evaluated using data set of nanogrid houses. The outcomes revealed that IoT-task orchestration has played a pivotal role in efficient energy management for nanogrid mission-critical system. Furthermore, the comparison with state-of-the-art scheduling algorithms showed that the task starvation rate is reduced to 16% and 12% when compared with RR and FEF algorithms, respectively.

Bus operators around the world are facing the transformation of their fleets from fossil-fuelled to electric buses. Two technologies prevail: Depot charging and opportunity charging at terminal stops. Total cost of ownership (TCO) is an important metric for the decision between the two technologies, however, most TCO studies for electric bus systems rely on generalised route data and simplifying assumptions that may not reflect local conditions. In particular, the need to re-schedule vehicle operations to satisfy electric buses’ range and charging time constraints is commonly disregarded. We present a simulation tool based on discrete-event simulation to determine the vehicle, charging infrastructure, energy and staff demand required to electrify real-world bus networks. These results are then passed to a TCO model. A greedy scheduling algorithm is developed to plan vehicle schedules suitable for electric buses. Scheduling and simulation are coupled with a genetic algorithm to determine cost-optimised charging locations for opportunity charging. A case study is carried out in which we analyse the electrification of a metropolitan bus network consisting of 39 lines with 4748 passenger trips per day. The results generally favour opportunity charging over depot charging in terms of TCO, however, under some circumstances, the technologies are on par. This emphasises the need for detailed analysis of the local bus network in order to make an informed procurement decision.

In the past decade, we have witnessed a dramatically increasing volume of data collected from varied sources. The explosion of data has transformed the world as more information is available for collection and analysis than ever before. To maximize the utilization, various machine and deep learning models have been developed, e.g. CNN [1] and RNN [2], to study data and extract valuable information from different perspectives. While data-driven applications improve countless products, training models for hyperparameter tuning are still time-consuming and resource-intensive. Cloud computing provides infrastructure support for the training of deep learning applications. The cloud service providers, such as Amazon Web Services [3], create an isolated virtual environment (virtual machines and containers) for clients, who share physical resources, e.g., CPU and memory. On the cloud, resource management schemes are implemented to enable better sharing among users and boost the system-wide performance. However, general scheduling approaches, such as spread priority and balanced resource schedulers, do not work well with deep learning workloads. In this project, we propose SpeCon, a novel container scheduler that is optimized for shortlived deep learning applications. Based on virtualized containers, such as Kubernetes [4] and Docker [5], SpeCon analyzes the common characteristics of training processes. We design a suite of algorithms to monitor the progress of the training and speculatively migrate the slow-growing models to release resources for fast-growing ones. Specifically, the extensive experiments demonstrate that SpeCon improves the completion time of an individual job by up to 41.5%, 14.8% system-wide and 24.7% in terms of makespan.

In the design of multi-loop Networked Control Systems (NCSs) wherein each control system is characterized by heterogeneous dynamics and associated with certain set of timing specifications and constraints, appropriate metrics need to be employed for the synthesis of control and networking policies to efficiently respond to the requirements of each control loop. Majority of the design approaches for sampling, scheduling and control policies include either time-based or event-based metrics to perform pertinent actions in response to the changes of the parameters of interest. We specifically focus in this article on Age-of-Information (AoI) as a recently-developed time-based metric and threshold-based triggering function as a generic event-based metric. As the NCS model, we consider multiple heterogeneous stochastic linear control systems that close their feedback loops over a shared-resource communication network. We investigate the co-design across the NCS, and discuss the pros and cons with AoI and ET approaches in terms of asymptotic control performance measured by linear-quadratic Gaussian (LQG) cost functions. In particular, sampling and scheduling policies combining AoI and stochastic event-triggered metrics are proposed. It is argued that pure AoI functions that generate decision variables solely upon minimizing the average age irrespective of control systems dynamics may not be able to improve the overall NCS performance even compared with pure randomized policies. Our theoretical analyses are successfully validated through several simulation scenarios.

In recent years, the management of health systems is a main concern of governments and decision makers. Home health care is one of the newest methods of providing services to patients in developed societies that can respond to the individual lifestyle of modern age and the increase of life expectancy. The home health care routing and scheduling problem is a generalized version of the vehicle routing problem, which is extended to a complex problem by adding special features and constraints of health care problems. In this problem, there are multiple stakeholders such as nurses for which an increase of their satisfaction level is very important. In this study, a mathematical model is developed to expand traditional home health care routing and scheduling models to downgrading cost aspects by adding the objective of minimizing the difference between the actual and potential skills of the nurses. Downgrading can lead to a dissatisfaction of the nurses. In addition, skillful nurses have higher salaries and high-level services increase equipment costs and need more expensive trainings and nursing certificates. Therefore, downgrading can enforce hidden huge costs to the managers of a company. To solve the bi-objective model, an -constraint based approach is suggested and the model applicability and its ability to solve the problem in various sizes are discussed. A sensitivity analysis on the Epsilon parameter is conducted to analyze the effect of this parameter on the problem. Finally, some managerial insights are presented to help the managers in this field, and some directions for future studies are mentioned as well.

In the manufacturing industry, orders are typically scheduled and delivered through batches, and the probability of machine failure under high-load operation is high. On this basis, we focus on a single machine batch scheduling problem with a maintenance interval (SMBSP-MI). The studied problem is expressed by three-field representation as 1|B,MI|\sum{F_j+\mu}m, and the optimization objective is to minimize total flow time and delivery costs. Firstly, 1|B,MI|\sum{F_j+\mu}m is proved to be NP-hard by Turing reduction. Secondly, shortest processing time (SPT) order is shown the optimal scheduling of SMBSP-MI, and a dynamic programming algorithm based on SPT (DPA-SPT) with the time complexity of O(n^3T_1) is proposed. A small-scale example is designed to verify the feasibility of DPA-SPT. Finally, DPA-SPT is approximated to a fully-polynomial dynamic programming approximation algorithm based on SPT (FDPAA-SPT) by intervals partitioning technique. The proposed FDPAA-SPT runs in O(\frac{n^5}{\varepsilon^2})\ time with the approximation (1+\varepsilon).

We propose a model for medium-term hydropower scheduling (MTHS) with variable head and uncertainty in inflow, reserve capacity, and energy price. With an increase of intermittent energy sources in the generation mix, it is expected that a flexible hydropower producer can obtain added profits by participating in other markets than just the energy market. To capture this added potential the hydropower system should be modeled with a higher level of details. In this context, we apply an algorithm based on stochastic dual dynamic programming (SDDP) to solve the nonconvex MTHS problem, and show that the use of Strengthened Benders (SB) cuts to represent the expected future profit (EFP) function provide accurate scheduling results for slightly nonconvex problems. A method to visualize the EFP function in a dynamic programming setting is provided, serving as a useful tool for a priori inspection of the EFP shape and its nonconvexity.

The advent of deep learning has completely reshaped our world. Now, our daily life is fulfilled with many well-known applications that adopt deep learning techniques, such as self-driving cars and face recognition. Furthermore, robotics developed more forms of technology which share the same principle with face recognition, such as hand pose recognition and fingerprint recognition. Image recognition technology requires a huge database and various learning algorithms, such as convolutional neural network and recurrent neural network, that requires lots of computational power, such as CPUs and GPUs. Thus, clients could not be satisfied with the computational resource of the local machine. The cloud resource platform emerged at a historic moment. Docker containers play a significant role of microservices-based applications in the next generation. However, it could not guarantee the quality of service. From clients’ perspective, they have to balance the budget and quality of experiences (e.g. response time). The budget leans on individual business owners and the required Quality of Experience (QoE) depends on usage scenarios of different applications, for instance, an autonomous vehicle requires real-time response, but, unlocking your smartphone can tolerate delays. Plenty of on-going projects developed user-oriented optimization resource allocation to improve the quality of the service. Considering the users’ specifications, including accelerating the training process and specifying the quality of experience, this thesis proposes two differentiate containers scheduling for deep learning applications: TRADL and DQoES .

Future cyber-physical systems may extend over broad geographical areas, like cities or regions, thus requiring the deployment of large real-time networks. A strategy to guarantee predictable communication over such networks is to synthesize an offline time-triggered communication schedule. However, this synthesis problem is computationally hard (NP-complete), and existing approaches do not scale satisfactorily to the required network sizes. This article presents a segmented offline synthesis method which substantially reduces this limitation, being able to generate time-triggered schedules for large hybrid (wired and wireless) networks. We also present a series of algorithms and optimizations that increase the performance and compactness of the obtained schedules while solving some of the problems inherent to segmented approaches. We evaluate our approach on a set of realistic large-size multi-hop networks, significantly larger than those considered in the existing literature. The results show that our segmentation reduces the synthesis time up to two orders of magnitude.

Scheduling of real time tasks are very important aspect in systems as processes should complete its task at a specific time. There is a need of high energy efficiency and low response time in large data stream so for this energy efficient resources and optimized frameworks are needed. Both hard real time and mixed critically systems are targeted. Soft deadline can be handled while hard deadlines are difficult to cater. Different algorithms are used to schedule tasks like rate monotonic, earliest deadline first, deadline monotonic etc.

Irrigation scheduling is used by growers to determine the right amount and timing of water application. In most parts of Mozambique, 90% of the total yearly precipitation occurs from November to March. The El Niño Southern Oscillation (ENSO) phenomenon influences the climate in Mozambique and affects the water demand for crop production. The objectives of this work were to quantify the effects of ENSO phenomenon on tomato crop water requirements, and to create the AgroClimate irrigation tool (http://mz.agroclimate.org/) to assist farmers in improving irrigation management. This study was based on daily grid-based climate information from 1983 to 2016 from the Climate Forecast System Reanalysis. Daily crop evapotranspiration was calculated by Hargreaves equation and crop coefficients. This tool is available online and considers different planting dates, ENSO phases, and crop growing season lengths. Irrigation needs varied from less than 250 mm per growing cycle during winter to 550 mm during spring. Both El Niño and La Niña influenced the irrigation scheduling, especially from November to March. El Niño periods were related with increased water demand due to drier and warmer conditions while the opposite was observed for La Niña. The ENSO information might be used to understand climate variability and improve tomato irrigation scheduling in Mozambique.

The explosion of data has transformed the world since much more information is available for collection and analysis than ever before. To extract valuable information from the data in different dimensions, various deep learning models have been developed in the past years. Although these models have demonstrated their strong capability on improving products and services in various applications, training them is still a time-consuming and resource-intensive process. Presently, cloud, one of the most powerful computing infrastructures, has been used for the training. However, how to manage cloud computing resources and to perform the training efficiently is still challenging current techniques. For example, general resource scheduling approaches, such as spread priority and balanced resource schedulers, actually do not work well with deep learning workloads. Besides, the resource allocation problem on a cluster can be divide into two subproblems: (1) local resource optimization: improve resource configuration for a single machine; (2) global resource optimization: improve the cluster-wide resource allocation. In this thesis, we propose two novel container schedulers, FlowCon and SpeCon, that are designed to address these two subproblems respectively and specifically to optimize performance of short-lived deep learning applications in the cloud. FlowCon focuses on resource configuration of single-node in a cluster, as show that it efficiently improves deep learning tasks completion time and resource utilization, and reduces the completion time of a specific job by up to 42.06\% without sacrificing the overall system time. SpeCon targets on cluster-wide resource configuration that speculatively migrate slow-growing models to release resources for fast-growing ones. Based on our experiments, SpeCon improves makespan for up to 24.7\%, compared to current approaches.

Advances in communication technologies have made the interaction of small devices, such as smartphones, wearables, and sensors, scattered on the Internet, bringing a whole new set of complex applications with ever greater task processing needs. These Internet of Things (IoT) devices run on batteries with strict energy restrictions. They tend to offload task processing to remote servers, usually to Cloud Computing (CC) in datacenters geographically located away from the IoT device. In such a context, this work proposes a dynamic cost model to minimize energy consumption and task processing time for IoT scenarios in Mobile Edge Computing environments. Our approach allows for a detailed cost model, with an algorithm called TEMS that considers energy, time consumed during processing, the cost of data transmission, and energy in idle devices. The task scheduling chooses among Cloud or Mobile Edge Computing (MEC) server or local IoT devices to better execution time with lower cost. The simulated environment evaluation saved up to 51.6% energy consumption and improved task completion time up to 86.6%.

Presently power control and management play a vigorous role in information technology and power management. Instead of non-renewable power manufacturing, renewable power manufacturing is preferred by every organization for controlling resource consumption, price reduction and efficient power management. Smart grid efficiently satisfies these requirements with the integration of machine learning algorithms. Machine learning algorithms are used in a smart grid for power requirement prediction, power distribution, failure identification etc. The proposed Random Forest-based smart grid system classifies the power grid into different zones like high and low power utilization. The power zones are divided into number of sub-zones and map to random forest branches. The sub-zone and branch mapping process used to identify the quantity of power utilized and the non-utilized in a zone. The non-utilized power quantity and location of power availabilities are identified and distributed the required quantity of power to the requester in a minimal response time and price. The priority power scheduling algorithm collect request from consumer and send the request to producer based on priority. The producer analysed the requester existing power utilization quantity and availability of power for scheduling the power distribution to the requester based on priority. The proposed Random Forest based sustainability and price optimization technique in smart grid experimental results are compared to existing machine learning techniques like SVM, KNN and NB. The proposed random forest-based identification technique identifies the exact location of the power availability, which takes minimal processing time and quick responses to the requestor. Additionally, the smart meter based smart grid technique identifies the faults in short time duration than the conventional energy management technique is also proven in the experimental results.

Sustainability is the core concern of every business; The exploration of avenues to maintain sustainability while staying competitive with high level of productivity remains a vital endeavor. Production flexibility is a key area that can enhance the sustainability of manufacturing industries as it can ensure product availability, scalability, agility/fault tolerance as well as disaster recovery potentials. Technological advancements have provided avenues where companies can enhance virtually all aspects of their operations for efficiency, effectiveness, and productivity. This paper uses both quantitative and qualitative research approach to identify the capability requirements for smart and effective production management and subsequent analysis is done using Multi-Criteria Decision-Making methodology to identify and rank various industry 4.0 technologies and concepts that can provide these smart capabilities in in manufacturing industries to aid the businesses to achieve sustainability with production flexibility. The paper identifies over 12 smart capabilities and 9 Industry 4.0 Technologies which are applicable to production management. It also compares results from the analytics of historical I4.0 implementation as discussed in literatures with the current state as deduces from survey feedbacks from various manufacturing industries.

For an enterprise, the most critical aspect of development is resource management, which has a significant impact on all aspects of the enterprise. Therefore, enterprises must pay attention to resource management allocation, which can better promote the sustainable development of the enterprise and obtain optimal benefits. In the production and development of modern enterprises, the acquisition of benefits also involves the allocation of resources in enterprise management. This paper proposed a benefit optimization scheduling algorithm based on a macroeconomic prediction model under auction mechanism and a grid resource scheduling algorithm driven by a benefit function to allocate resources reasonably. This article used macroeconomic forecasting models to fully understand the resource needs of various departments and the resources held by enterprises, and rationally allocate various resources in various departments. This can improve the work efficiency of various departments, thereby reducing the cost of the enterprise, and achieving optimal benefits for the enterprise. The experimental results in this paper showed that the cost of resource management allocation for the benefit optimization scheduling algorithm and the grid resource scheduling algorithm based on the benefit function driven under the auction mechanism was 105.6 yuan and 46.8 yuan respectively when the task volume was 125 under the multi user environment. The time allocated for resource management was 36.6s and 18.9s respectively. It can be seen that the efficiency function driven grid resource scheduling algorithm had a lower cost and time for resource management allocation, so the efficiency function driven grid resource scheduling algorithm can achieve enterprise efficiency optimization.

Predictive maintenance (PM) algorithms are widely applied for detecting operational anomalies on industrial processes to trigger maintenance before a possible breakdown; however, much less focus has been devoted to the use of such PM predictions as feedback in automated process control mechanisms. They usually integrate preventive solutions to protect the machines, usually causing downtimes. The premise of this study is to develop a holistic adaptive process scheduling mechanism that incorporates PM analysis as a safety component to optimize the operation mode of an industrial process toward preventing breakdowns while maintaining its availability and operational state, thereby reducing downtimes. As PM is largely a data-driven approach; hence, relies on the setup, we first compare different PM approaches and identify a one-class support vector machine (OCSVM) as the best performing option for the anomaly detection on our setup. Then, we propose a novel pipeline to integrate maintenance predictions into a real-time adaptive process scheduling mechanism. It schedules for the most suitable operation, i.e., optimizing for machine health and process efficiency, according to the abnormal readings. To demonstrate the pipeline on action, we implement our approach on a small-scale conveyor belt system utilizing our Internet of Things (IoT) framework. The results show that our PM-based adaptive process control provides an efficient process with less or no downtime. We also conclude that a PM approach does not provide sufficient efficiency without its integration into an autonomous planning process.

In a safety-critical system typically not all provided services have the same criticality, which we call mixed-criticality systems. Criticality arithmetic, also called SIL arithmetic, is an approach to lower the development effort of a service by providing redundancy with tasks that are developed for a lower criticality level. In this paper we present ATMP-CA, which is a derivation of the multi-core scheduler ATMP. ATMP-CA is able to take into account the knowledge about the use of criticality arithmetic. ATMP-CA has a modified core allocation and procedure for utility optimisation, considering the context of the replicated tasks. We conducted experiments that show that ATMP-CA is able to provide the services using criticality arithmetic, while the reference schedulers were not.

The search algorithm based on symbiotic organisms’ interactions is a relatively recent bio-inspired algorithm of the swarm intelligence field for solving numerical optimization problems. It is meant to optimize applications based on the simulation of the symbiotic relationship among the distinct species in the ecosystem. The modified SOS algorithm is developed to solve independent task scheduling problems. This paper proposes a modified symbiotic organisms search based scheduling algorithm for efficient mapping of heterogeneous tasks to access cloud resources of different capacities. The significant contribution of this technique is the simplified representation of the algorithm's mutualism process, which uses equity as a measure of relationship characteristics or efficiency of species in the current ecosystem to move to the next generation. These relational characteristics are achieved by replacing the original mutual vector, which uses an arithmetic mean to measure the mutual characteristics with a geometric mean that enhances the survival advantage of two distinct species. The modified symbiotic organisms search algorithm (G_SOS) aimed to minimize the task execution time (Makespan), response, degree of imbalance and cost and improve the convergence speed for an optimal solution in an IaaS cloud. The performances of the proposed technique have been evaluated using a Cladism toolkit simulator, and the solutions are found to be better than the existing standard (SOS) technique and PSO.

Renewable Energy Communities (RECs) are emerging as an effective concept and model to empower the active participation of citizens on the energy transition, not only as energy consumers, but also as promoters of environmentally friendly energy generation solutions. This paper aims to contribute to the management and optimization of individual and community Distributed Energy Resources (DER). The solution follows a price and source-based REC management program, in which consumers day-ahead flexible loads (Flex Offers) are shifted according to electricity generation availability, prices and personal preferences, to balance the grid and incentivize user participation. The heuristic approach used in the proposed algorithms allows the optimization of energy resources in a distributed edge and fog approach with a low computational overhead. The simulations performed using real world energy consumption and flexibility data of a REC with 50 dwellings show an average cost reduction of 10.6% and an average increase of 11.4% in individual self-consumption. Additionally, the case-study demonstrates promising results regarding grid load balancing and the introduction of intra-community energy trading.

We consider the problem of scheduling $n$ jobs with identical processing times and given release as well as delivery times on $m$ uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job. This problem is well-known to have an open complexity status even if the number of jobs is fixed. We present a polynomial-time algorithm for the problem which is based on the earlier introduced algorithmic framework blesscmore (``branch less and cut more''). We extend the analysis of the so-called behavior alternatives developed earlier for the version of the problem with identical parallel machines and show how the earlier used technique for identical machines can be extended to the uniform machine environment if a special condition on the job parameters is imposed. The time complexity of the proposed algorithm is $O(\gamma m^2 n\log n)$, where $\gamma$ can be either $n$ or the maximum job delivery time $q_{\max}$. This complexity can even be reduced further by using a smaller number $\kappa<n$ in the estimation describing the number of jobs of particular types. However, this number $\kappa$ becomes only known when the algorithm has terminated.

In recent years, the individualized demand of customers brings small batches and diversification of orders towards enterprises. The application of enabling technologies in 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 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.

Applications in high-performance computing (HPC) may not use all available computational resources, leaving some of them underutilized. By co-scheduling, i.e. running more than one application on the same computational node, it is possible to improve resource utilization and overall throughput. Some applications may have conflicting requirements on resources and co-scheduling may cause performance degradation, so it is important to take it into account in scheduling decisions. In this paper, we formalized co-scheduling problem and proposed multiple scheduling strategies to solve it: an optimal strategy, an online strategy and heuristic strategies. These strategies vary in terms of the optimality of the solution they produce and a priori information about the system they require. We showed theoretically that the online strategy provides schedules with a competitive ratio that has a constant upper limit. This allowed us to solve the co-scheduling problem using heuristic strategies that approximate this online strategy. Numerical simulations showed how heuristic strategies compare to the optimal strategy for different input systems. We proposed a method for measuring input parameters of the model in practice and evaluated this method on HPC benchmark applications. We showed high accuracy of measurement method, which allows to apply proposed scheduling strategies in scheduler implementation.

The main goal of this paper is to show that Bayesian optimization could be regarded as a general framework for the data driven modelling and solution of problems arising in water distribution systems. Hydraulic simulation, both scenario based, and Monte Carlo is a key tool in modelling in water distribution systems. The related optimization problems fall in a simulation/optimization framework in which objectives and constraints are often black-box. Bayesian Optimization (BO) is characterized by a surrogate model, usually a Gaussian process, but also a random forest and increasingly neural networks and an acquisition function which drives the search for new evaluation points. These modelling options make BO nonparametric, robust, flexible and sample efficient particularly suitable for simulation/optimization problems. A defining characteristic of BO is its versatility and flexibility, given for instance by different probabilistic models, in particular different kernels, different acquisition functions. These characteristics of the Bayesian optimization approach are exemplified by the two problems: cost/energy optimization in pump scheduling and optimal sensor placement for early detection on contaminant intrusion. Different surrogate models have been used both in explicit and implicit control schemes. Showing that BO can drive the process of learning control rules directly from operational data. BO can also be extended to multi-objective optimization. Two algorithms have been proposed for multi-objective detection problem using two different acquisition functions.

An approach to estimating the objective function value of minimization maximum lateness problem is proposed. It is shown how to use transformed instances to define a new continuous objective function. After that, using this new objective function, the approach itself is formulated. We calculate the objective function value for some polynomially solvable transformed instances and use them as interpolation nodes to estimate the objective function of the initial instance. What is more, two new polynomial cases, that are easy to use in the approach, are proposed. In the end of the paper numeric experiments are described and their results are provided.

Due to production space and operating environment requirements, mine production equipment often breaks down, which seriously affects the mine’s production schedule. To ensure the smooth completion of the haulage operation plan under abnormal conditions, a model of the haulage equipment rescheduling plan based on the random simulation of equipment breakdowns is established in this paper. The model aims to accomplish both the maximum completion rate of the original mining plan and the minimum fluctuation of the ore grade during the rescheduling period. This model is optimized by improving the wolf colony algorithm and changing the location update formula of the individuals in the wolf colony. Then, the optimal model solution can be used to optimize the rescheduling of the haulage plan by considering equipment breakdowns. The application of the proposed method in an underground mine revealed that the completion rate of the mine’s daily mining plan reached 83.40% without increasing the number of the equipment, while and the ore quality was stable. Moreover, the improved optimization algorithm converged fast and was characterized by high robustness.

University course scheduling (UCS) is one of the most important and time-consuming issues that all educational institutions face yearly. Most of the existing techniques to model and solve UCS problems have applied approximate methods, which are different in terms of efficiency, performance, and optimization speed. Accordingly, this research aims to apply an exact optimization method to provide an optimal solution to the course scheduling problem. In other words, in this research, an integer programming model is presented to solve the USC problem. In this model, hard and soft constraints include the facilities of classrooms, courses of different levels and compression of students' curriculum, courses outside the faculty and planning for them, and the limited time allocated to the professors. The objective is to maximize the weighted sum of allocating available times to professors based on their preferences in all periods. To evaluate the presented model's feasibility, it is implemented using the GAMS software. Finally, the presented model is solved in a larger dimension using a real data set from a college in China and compared with the current program in the same college. The obtained results show that considering the mathematical model's constraints and objective function, the faculty courses' timetable is reduced from 4 days a week to 3 working days. Moreover, master courses are planned in two days, and the courses in the educational groups do not interfere with each other. Furthermore, by implementing the proposed model for the real case study, the maximum teaching hours of the professors are significantly reduced. The results demonstrate the efficiency of the proposed model and solution method in terms of optimization speed and solution accuracy.

The problem of optimal scheduling in a system with parallel queues and a single server has been extensively studied in the queueing theory. However, such systems have mostly been studied by assuming homogeneous attributes of arrival and service processes, or in heterogeneous case a Markov random process was usually assumed. In this paper, we explore the possibility of combining simulation and neural network paradigms for optimal scheduling in a heterogeneous system with an arbitrary inter-arrival and service time distributions. The service of any queue by the server is exhaustive. Further routing of the server after the queue has been emptied is as instructed by the trained neural network. Any change in the queue that currently has a server is accompanied by a switching cost. The simulated annealing optimization algorithm which is used to optimize the parameters of the neural network was adapted for numerically evaluated average cost function. A Markov decision problem was formulated for the corresponding markovian queueing system to verify the results of solving the optimization problem. In addition to comparing the actual values of the average cost, the parameter values of the neural network trained on the optimal control policy of the Markov model are also used to determine the domains of parameters required for the simulated annealing defined on a finite discrete domain. Numerical analysis shows the effectiveness of this approach. Moreover, a comparison of the results for different distributions illustrates the insensitivity of the optimal control policy to the shape of the distributions for the same two first moments. Thus, the optimal control policy for an exponential model can be used as a suboptimal one for the general system.

The ultimate aim of dynamic load balancing in cloud computing systems is to maximise the efficiency with which resources are utilised and workloads are distributed. Given that load balancing is a multi-objective process and that response time is a priority, the Harris hawk optimisation (HHO) algorithm was developed as a unique solution for dynamic load balancing. Based on burden distribution and resource utilisation, the HHO algorithm is responsible for dynamically assigning workloads to virtual machines (VMs). Through iterative interactions and position updates, the hawks investigate the solution space, determine the optimal method for dividing the work, and adapt to the ever-changing conditions of the workload. The HHO algorithm has been demonstrated to be effective and efficient in the management of dynamic load balancing via a series of experimental evaluations and comparisons with other load-balancing approaches. These discoveries have led to quicker response times and more efficient resource utilisation. Utilising the collaborative search behaviour of hawks, this technique provides a solution that is both practicable and effective for addressing load balancing concerns in dynamic scenarios.

This systematic literature review explores the burgeoning use of Artificial Intelligence (AI) in manufacturing systems, in line with the principles of Industry 4.0 and the growth of smart factories. In this landscape, AI is crucial in addressing the complexity and dynamism of contemporary manufacturing processes, including machine breakdowns, fluctuating orders and unpredictable job arrivals. This systematic literature review, conducted using the Scopus database and bibliometric tools, pursues two primary objectives. First, it identifies the prevailing trends in solving scheduling problems with AI and identifies the most commonly used AI techniques in the literature. Secondly, it analyses how authors have successfully employed AI to address production scheduling challenges in real-world industrial settings and assesses the benefits obtained by companies. The dynamic nature of manufacturing systems requires adaptive scheduling paradigms. AI, including Particle Swarm Optimization, Neural Networks, and Reinforcement Learning, is applied to optimize production processes, predict machine failures, and achieve substantial benefits. In real-world applications, these AI-driven solutions have led to reduced production costs, enhanced energy efficiency, and more efficient scheduling processes. AI is increasingly recognized as an essential tool in addressing the evolving challenges of modern manufacturing environments.

This work addresses the lot-sizing and production scheduling problem of multi-stage multi-product food industrial facilities. More specifically, the production scheduling problem of the semi-continuous yogurt production process, for two large-scale Greek dairy industries, is considered. Production scheduling decisions are taken using two approaches: i) an optimization and ii) a rule-based approach, followed by a comparative study. A MILP model is applied for the optimization of short-term production scheduling of the two industries. Then, the same problems are solved using the commercial scheduling tool ScheduleProTM, which derives scheduling decisions, using simulation-based techniques and empirical rules. It is concluded that both methods, despite having their advantages and disadvantages, are suitable for addressing complex food industrial scheduling problems. The optimization-based approach leads to better results in terms of operating cost reduction. On the other hand, the complexity of the problem and the experience of production engineers and plant operators can significantly impact the quality of the obtained solutions for the rule-based approach.

: Seasonal influenza (a.k.a flu) is responsible for considerable morbidity and mortality across the globe. The three recognized pathogens that cause epidemics during the winter season are influenza A, B and C. The influenza virus is particularly dangerous due to its mutability. Vaccines are an effective tool in preventing seasonal influenza, and their formulas are updated yearly according to WHO recommendations. However, in order to facilitate decision-making in the planning of the intervention, policymakers need information on the projected costs and quantities related to introducing the influenza vaccine, in order to help governments obtain an optimal allocation of the vaccine each year. In this paper, an approach based on a Controlled Elitism Non-Dominated Sorting Genetic Algorithm (CENSGA) model is introduced to optimize the allocation of influenza vaccination. A bi-objective model is formulated to control the infection volume, and reduce the unit cost of the vaccination campaign. An SIR (Susceptible–Infected–Recovered) model is employed for representing a potential epidemic. The model constraints are based on the epidemiological model, time management, and vaccine quantity. A two-phase optimization process is proposed: guardian control followed by contingent controls. The proposed approach is an evolutionary metaheuristic multi-objective optimization algorithm with a local search procedure based on a hash table. Moreover, in order to optimize the scheduling of a set of policies over a predetermined time to form a complete campaign, an extended CENSGA is introduced with a variable-length chromosome (VLC) along with mutation and crossover operations. To validate the applicability of the proposed CENSGA, it is compared with the classical Non-Dominated Sorting Genetic Algorithm (NSGA-II). The results are analyzed using graphical and statistical comparisons in terms of cardinality, convergence, distribution and spread quality metrics, illustrating that the proposed CENSGA is effective and useful for determining the optimal vaccination allocation campaigns.

With the rapid development of the Internet of Things, massive amounts of data will be generated at the network edge, resulting in increased latency of the traditional cloud computing model. Cloud service providers deploy edge servers near the users to improve the quality of service. Due to the large scale of networks, the inefficiency of edge server deployment and task scheduling will result in excessive latency and severe workload imbalance among edge servers. In this paper, we propose a Server Deployment and Task Scheduling (SDTS) framework in multi-edge collaborative computing, which can effectively reduce latency and ensure workload balancing. First, a metropolitan area network (MAN) is divided into dense candidate regions (DCRs) based on the density characteristics of mobile end devices, and then servers are deployed independently in each sub-region. Then, a two-step clustering algorithm is designed to deploy servers as close as possible to the mobile devices. Finally, a task scheduling algorithm is presented based on an edge scheduling layer in DCRs, which can leverage collaboration between edge servers to improve the performance of the entire edge computing system. The experimental results based on the Cellular Base Station (CBS) dataset of Shanghai Telecom indicate that the proposed approach outperforms several representative strategies in terms of latency and workload balancing.

. Manufacturers are increasingly adopting mixed-flow manufacturing models to meet the growing customized, diverse, and dynamic customer demand. In such an environment, material distribution scheduling optimization is vital for smooth operations and is integral to production management. However, manufacturers frequently encounter problems like disordered and delayed material distribution. Traditional scheduling methods suffer from problems like inadequate transparency, delayed decision directives, and suboptimal results, impacting performance. To this end, this study proposes a dynamic material distribution scheduling optimization model and strategy based on digital twin (DT) to address these problems. Firstly, we introduce workstation satisfaction and establish a material distribution path optimization model minimizing total distribution cost while maximizing workstation satisfaction. Subsequently, we present a cloud-edge computing-based decision framework and explain the DT-based material distribution system's components and operation. Furthermore, a dynamic material distribution scheduling optimization mechanism based on DT is designed. By incorporating a savings method and incentive, penalty strategies, improvements are made to the path node selection probabilities and the information pheromone update rules of the traditional ant colony optimization (ACO) algorithm. Finally, a numerical case study, using real data from collaborating enterprises, validates the proposed algorithm and strategy. This research offers valuable insights into logistics management and algorithm design in smart manufacturing environments.

Home care centers face both an increase in demand and many variations during the execution of routes, compromising the routes initially planned: robust solutions are not effective enough, it is necessary to move on to resilient approaches. We create a close to reality use case supported by interviews of staff at home health care centers, where caregivers are faced with unexpected events that compromise their initial route. We model, analyze and compare three resilient approaches to deal with these disruptions: a baseline approach without any collaboration, a distributed collaborative approach, and a centralized collaborative approach, where we propose a centralization and sharing of information to improve local decision-making. The latter reduces the number of late arrivals by 11% and the total time of late arrival by 21%, and also halves the number of routes exceeding the end of work time (contrary to the distributed collaborative approach, due to the time wasted reaching colleagues). The use of a device, such as a smartphone application, to centralize and share information thus allows better mutual assistance between caregivers. Moreover, we highlight several possible openings like the coupling of simulation and optimization to propose a more resilient approach.

The fast-paced evolution of artificial intelligence (AI), machine learning (ML), natural language processing (NLP), large language model (LLM) applications, and generative pre-trained transformer (GPT) have set the stage for improved and autonomous project scheduling models. This study demonstrates how project scheduling can be enhanced by employing building information modeling (BIM) to predict reliable schedules for each project element. The research is based on design science research (DSR) methodology and focus group discussion. The proposed system consists of six components: project analyzer, data warehouse, activity identifier and sequencing, activity magnitude and direct cost calculator, activity duration calculator, and schedule analyzer. Unlike other solutions, the proposed solution sequences activities based on an ML model rather than constraint matrices. The proposed solution thus enhances project performance through proactive planning and risk management. Integrating the autonomous project scheduling solution with the other components of an autonomous project management system would surmount schedule challenges and would result in greater cost efficiency and fewer delays.

In this paper, we propose, implement, and test two novel downlink LTE scheduling algorithms. The implementation and testing of these algorithms were in Matlab, and they are based on the use of Reinforcement Learning, more specifically, the Qlearning technique for scheduling two types of users. The first algorithm is called a Collaborative scheduling algorithm, and the second algorithm is called a Competitive scheduling algorithm. The first type of the scheduled users is the Primary Users, and they are the licensed subscribers that pay for their service. The second type of the scheduled users is the Secondary Users, and they could be unlicensed subscribers that dont pay for their service, device to device communications, or sensors. Each user whether it is a primary or secondary is considered as an agent. In the Collaborative scheduling algorithm, the primary user agents will collaborate in order to make a joint scheduling decision about allocating the resource blocks to each one of them, then the secondary user agents will compete among themselves to use the remaining resource blocks. In the Competitive scheduling algorithm, the primary user agents will compete among themselves over the available resources, then the secondary user agents will compete among themselves over the remaining resources. Experimental results show that both scheduling algorithms converged to almost ninety percent utilization of the spectrum, and provided fair shares of the spectrum among users.

Unexpected preoperative surgery cancellations are one of the important problems in daily anesthesia practice. It's an even bigger problem if these cancellations happen in the operating room. Our aim was to draw attention to this issue and reveal the reasons. This prospective, cross-sectional study aimed to assess the prevalence and causes of elective surgery cancellations once patients are in the operating room. The study sample consisted of 7482 adult patients scheduled for elective surgeries and taken to the operating room. Sixty-seven patients whose surgeries were canceled were grouped into Group 1, while the remaining 7415 whose surgeries were completed were in Group 2. Patients were divided into two groups based on whether their surgeries were completed or canceled. Factors such as age, American Society of Anesthesiologists physical status, and surgical department were analyzed. Metrics involved comparisons between the two groups regarding age, American Society of Anesthesiologists physical status classification, surgical department, and timing of the surgery. The prevalence of elective surgery cancellations after patients were in the operating room was 0.9%. Group 1 was significantly older than Group 2 (p&lt;0.001). The proportion of patients classified as American Society of Anesthesiologists physical status III was higher in Group 1 (p&lt;0.001). The department with the highest cancellation rate was ophthalmology(2.5%), followed by general surgery(2.1%), urology(1.5%), and ear, nose, and throat(1.4%). Approximately 59.7% of cancellations were deemed potentially avoidable. The study suggests that many of these cancellations are potentially avoidable, underscoring the need for optimized surgical scheduling and patient assessment protocols.

Being able to complete the production of the product project on time is the prerequisite to win more tasks, many enterprises have begun to study intelligent scheduling algorithms to achieve dynamic control of the total project duration. However, the production operation time of products is highly volatile, and it is impossible to predict the possible operation time of future products. In the actual production environment, we often encounter extreme situations such as mixed production lines, multiple varieties, variable batches, etc. A dynamic optimization CPM model in the ERP/MES system with the attention mechanism (EMA-DCPM) will collect, extract and predict the operation time through artificial intelligence technology, and it can accurately predict the exact operation time of a batch of products that have not yet been produced. Through experiments, our algorithm can realize the production scheduling and get more than 200% better precision than former algorithms and realize dynamic optimization of complex projects.

Linear programming formulations of forest ecosystem management (FEM) problems proposed in the 60s have been adapted and improved upon over the years. Generating management alternatives for forest management planning is a key step in building these models. Global forests are diverse, and a variety of models have been developed to simulate management alternatives. Climate change has made forest management calculations even more complex, requiring flexibility, diverse parameters, models, and methods. Despite this complexity, consistent concepts can be applied in developing management alternatives for forest management planning. This work describes iGen, a flexible forest prescription generator that applies the AI technique Rule-Based System (AI-RBS). iGen projects the state and associated inputs and outputs for a set of management units using rules from its knowledge base. An Inference Engine uses the rules to simulate a set of prescriptions in a tree-like graph structure. Without needing IT specialists, forest managers can describe the potential development of their forest through variables, rules, formulas, functions, and procedures. A key feature of iGen is that it is not limited to, adapted to, or focused on any specific region, landscape, forest condition, projection method, or yield function. Instead, it aims to maximize generality, enabling it to address a broad range of FEM problems. This article introduces iGen, explaining its concepts, structure, and algorithms through two FEM problems: natural regeneration with shelterwood harvests and plantation/coppice. For data and iGen source programs, visit github.com/…/iGen.

Domain-specific systems-on-chip (DSSoCs) aim to narrow the gap between general-purpose processors and application-specific designs. CPU clusters enable programmability, while hardware accelerators tailored to the target domain minimize task execution times and power consumption. Traditional operating system (OS) schedulers can diminish the potential of DSSoCs as their execution times can be orders of magnitude larger than the task execution time. To address this problem, we propose a dynamic adaptive scheduling (DAS) framework that combines the advantages of a fast, low-overhead scheduler and a sophisticated, high-performance scheduler with a larger overhead. We present a novel runtime classifier that chooses the better scheduler type as a function of the system workload, leading to improved system performance and energy-delay product (EDP). Experiments with five real-world streaming applications indicate that DAS consistently outperforms fast, low-overhead, and slow, sophisticated schedulers. DAS achieves a 1.29x speedup and 45% lower EDP than the sophisticated scheduler under low data rates and a 1.28x speedup and 37% lower EDP than the fast scheduler when the workload complexity increases. Furthermore, we demonstrate that the superior performance of the DAS framework also applies to hardware platforms, with up to a 48% and 52% reduction in execution time and EDP, respectively.

Over-capacity flight scheduling by commercial airlines due to the surging demand in recent years creates congestion and significant delays at major airports. This maximizing throughput attitude calls for tactical flight rescheduling to comply with airports’ capacity limitations and distribute the peak hour demand over the course of a day. Such displacements of flights may cause significant problems and costs for airlines and some cancellations or missed connections for the passengers. This paper presents an optimization model for flight rescheduling at a schedule-coordinated airport to minimize congestion and flight delays. The optimization model is used to make better scheduling intervention decisions considering the airport resource constraints and safety of operation. We have also developed a simulation method to replicate arrival and departure processes in such an airport. The simulation adheres to a first come first served (FCFS) discipline and enforces runway capacity constraints and minimum turnaround times. We compare the delays caused by an ad hoc FCFS operation with those obtained by the optimization model. Computational results from a case study demonstrate that a reduction of 40.7% and 61.6% in total delay times for the arrival and departure flights can be achieved by the optimization model. It also facilitates implementing a collaborative decision-making system for better coordination with commercial airlines.

Continuous greenhouse gas emissions are causing global warming and impacting the habitats of many animals. Researchers in the field of electric power are making efforts to mitigate this situation. Operating and maintaining the power grid in an economic, low-carbon, and stable is challenging. To address the issue, we propose a grid dispatching technique that combines prediction technology, reinforcement learning, and optimization technology. Prediction technology can forecast future power demand and solar power generation, while reinforcement learning and optimization technology can make charging and discharging decisions for energy storage devices based on current and future grid conditions. In the power system, the aggregation of distributed energy resources increases uncertainty, particularly due to the fluctuating generation of renewable energy. This requires the use of advanced predictive control techniques to ensure long-term economic and decarbonization goals. In this paper, we present a real-time dispatching framework that integrates deep learning-based prediction, reinforcement learning-based decision-making, and stochastic optimization techniques. The framework can rapidly adapt to target uncertainty caused by various factors in real-time data distribution and control processes. The proposed framework achieved global Champion in the NeurIPS Challenge 2022 competition and demonstrated its effectiveness in practical scenarios of intelligent building energy management.

We study the robustness of the cμ-rule for the optimal allocation of a resource consisting of one unreliable server to parallel queues with two different classes of customers. The customers in queues can be served with respect to a FCFS retrial discipline, when the customers at the head of queues repeatedly tries to occupy the server in a random time. It is proved that for the scheduling problem in the system without arrivals the cμ-rule minimizes the total average cost. For the system with arrivals it is difficult directly to prove the optimality of the same policy with explicit relations. We derived for an infinite-buffer model a static control policy that also prescribes for the certain values of system parameters the service exclusively for the class-i customers if both of queues are not empty with the aim to minimize the average cost per unit of time. It is also shown that in a finite-buffer case the cμ-rule fails.

This study explores optimizing Synthetic Aperture Radar (SAR) satellite constellation scheduling for multi-imaging missions in densely targeted areas using an in-house developed Modified Dynamic Programming (MDP) algorithm. By employing Mixed-Integer Linear Programming (MILP) to define the mission planning problem, the research aims to maximize observation of high-value targets within restricted planning horizons. Numerical simulations, covering a wide range of target numbers and satellite configurations, reveal the MDP algorithm’s superior mission allocation efficiency, enhanced success rates, and reduced revisit times, compared to the Greedy algorithm. The findings underscore the MDP algorithm’s improved operational efficiency and planning robustness for complex imaging tasks, demonstrating significant advancements over traditional approaches.

Abstract: — management of the Continuous Stirred Tank Reactor (CSTR) operation has proven to be a difficult undertaking due to the complex and ever-changing nature of its behavior, which is both nonlinear and dynamic, which is further compounded by its instability. Attempts have been made to use Proportional-Integral-Derivative (PID) controllers for such processes, but the performance is often poor due to the inherent limitations of the controllers. In contrast, heuristic algorithms have been employed to tune the controllers, but these methods can only provide optimal performance for a restricted range of parameter variations. This paper presents a novel approach that involves using a conventional gain scheduling PID controller in combination with a fuzzy gain scheduling (FGS) controller method to calibrate set-point weighted PID controllers for the CSTR process. The paper outlines the design of the controllers and evaluates their performance by subjecting them to varying input signals within the given bandwidth.

Integrating a grid-connected battery into a Renewable Energy Community boosts Collective-Self-Consumption of photovoltaic produced energy and allow to perform Energy Arbitrage in the day-ahead and intraday electricity market. However, is it a cost-effective investment? The proposed analysis relay on Net Present Value assessment. Ageing affects are integrated and sensitivity analyses are conducted: considering community customers number, electricity mar-ket prices, battery cost, size and the decision to engage in energy arbitrage. Each scenario under-goes a 20-year hourly simulation using an ageing aware rolling-horizon 24-hours-looking-ahead scheduling, optimized with Mixed-integer linear Programming. Forecast errors, provid-ing of ancillary services, real time control and grid constrains are not taken into account. Simulations conducted on the Italian market indicates that a battery dedicated solely to collec-tive self-consumption is not economically appealing. However, integrating Energy Arbitrage, despite impact on battery lifespan, halves the payback period and enhances the attractiveness of larger battery investments. The Net Present Value is contingent upon battery size, customer number and market prices. However, if battery cost does not exceed 200 €/kWh the investment become cost-effective across all scenarios.

Reasonable allocation of production plans and saving the overall electricity cost are crucial for large manufacturing conglomerates, which is an effective way for conglomerates to realize open-source and cost-saving. This paper develops an optimization model of off-site industrial production scheduling for enterprises in response to the problems of high electricity costs due to the irrational allocation of production schedules on the demand side of China's electric power and the difficulty of promoting industrial and commercial distributed photovoltaic (PV) projects in China. The model makes full use of the conditions of different PV resources and different electricity prices in different places to optimize the scheduling of industrial production in different places. The model is embedded with two sub-models of the electricity price prediction model and distributed photovoltaic kWh cost model to complete the model parameters, in which the electricity price prediction model utilizes the LSTM neural network. The integrated model is then solved by the particle swarm algorithm. To verify the effectiveness of the model in solving the problem of off-site production scheduling on the demand side of electricity, the research team researched two off-site pharmaceutical factories belonging to the same large pharmaceutical company. Finally, the research data were substituted into the model for solving, and it was concluded that the optimization model could significantly reduce the cost of electricity consumption of the enterprise by about 7.9 %.

In this paper, possibilities for the bandwidth and wavelength utilization in future next-generation passive optical networks are presented and reasons for realizing and utilizing of extended dynamic wavelength and bandwidth algorithms for NG-PON2 networks are analyzed. Next, principles of the effective dynamic bandwidth allocation are introduced in details, focused on the importance of the decision criterion optimization. For achieving better bandwidth utilization of dedicated wavelengths, this paper is focused on the novel effective dynamic bandwidth allocation algorithm with adaptive allocation of wavelengths to ONU units and on the optimization of the decision criterion. For analyzing the novel extended DWBA algorithm utilizing for various wavelength allocation cases possible in NG-PON2 networks, a simulation program with the enhancement of the EDBA algorithm is realized. Finally, an optimization of the decision criterion defining a minimum bandwidth utilization of the actual wavelength is executed for NG-PON2 networks based on the hybrid TWDM technique.

Recently, there has been a growing interest in distributed edge computing resource scheduling. For example, application scenarios such as intelligent traffic systems and Internet of Things(IoT) intelligent monitoring require the scheduling and migration of distributed resources. Distributed resource scheduling needs to consider the cost of resource scheduling, with the primary goal of finding the optimal strategy among various feasible solutions. There are different definitions for optimization objectives in different application scenarios, such as cost, transmission delay, energy consumption, etc. Current research mainly considers the optimization problem of local resource scheduling but needs more consideration of global resource scheduling. This paper defines a global resource scheduling problem for distributed edge computing and proves that the problem is NP-Hard. A heuristic solution strategy based on the Ant Colony Algorithm(ACO) was proposed, and Particle Swarm Optimization(PSO) was used to optimize the parameters of the ACO. Finally, an experimental comparative analysis was conducted to demonstrate that the algorithm proposed in this paper has good accuracy and iteration cost performance.

An algorithm is proposed for discriminating the fatigue state of air traffic controllers based on ap-plying multispeech feature fusion using an FSVM to voice data, and for extracting eye-fatigue-state discrimination features based on PERCLOS eye data. For the speech algorithm and an eye-fatigue index, a new controller fatigue-state evaluation index based on the entropy weight method is proposed based on decision-level fusion of fatigue discrimination results for speech and the eyes. Experimental results show that the fatigue-state recognition accuracy rate was 84.81% for the fatigue state evaluation index, which was 3.36% and 1.86% higher than those for speech and eye assessments, respectively. The comprehensive fatigue evaluation index provides important reference values for controller scheduling and mental-state evaluations.

With the rapid development of Earth observation and information technology, people are increasingly able to access geospatial models. Geospatial models, based on principles of geography, utilize mathematical, statistical, as well as computer science methods to interpret and predict geographic phenomena. These models can be applied in the fields such as urban planning, environmental protection, traffic management to help decision-makers solve geography-related problems. However, integrating different geospatial models to collaboratively solve complex geographic problems still faces significant obstacles due to heterogeneity in model structure, dependencies, and running modes. In this study, we propose a containerized service-based integration framework for heterogeneous geospatial models (GeoCSIF). GeoCSIF consists of three main components: (1) Model encapsulation. It breaks down complicated geospatial models into independently manageable model units, and builds as unified service packages with a templated constraint method. (2) Model orchestration. It achieves an optimal combination of large-scale models with complex dependencies using a prioritization-based orchestration method. (3) Model publication. It incorporates heuristics into the model scheduling process, which can provide adaptive deployment for different model runs. Finally, a prototype system was developed to validate the effectiveness and progressiveness of GeoCSIF by the integrating process of heterogeneous flood disaster models.

Cellular Technology came into existence in Japan in 1979. From that time, we have seen many advances in technology. Currently, most of the person uses either 4G or 5G, among which 5G is a newer technology. 4G network was the first network to use LTE. LTE stands for Long Term Evaluation. Most people get confused between 4G and LTE, they assume both to be the same. In reality, LTE has evolved on the 4G technology. It was first introduced in 2008 to provide higher efficiency and data rates to the cellular network. It was designed to evolve the performance of the networks which includes the evolution of hardware components, optimization of software, power and cost efficiency. This work presents a study on LTE, LTE-A and VoLTE technology. We also discussed about the several packet scheduling algorithms that are being used for transmission of packets. It brings out new opportunities for the researchers to work on increasing the efficiency of those algorithms by modifications.

Due to the imbalance between the supply and demand of oxygen, the oxygen system of iron- and steel-making enterprises in China has problems with high oxygen emission and high pressure in the pipelines, resulting in the energy consumption of oxygen production being high. To relieve this problem, using a large-scale iron- and steel-making mill as a case study, the research on demand forecasting and optimal scheduling of the oxygen system was carried out. The ARIMA model and the GABP model are employed to forecast oxygen demand. Based on the forecast results, an optimal scheduling model for the oxygen system was developed to conduct optimal scheduling. The case study shows that based on the oxygen demand forecast and the optimal scheduling, the oxygen emission and the pipeline pressure in the studied iron- and steel-making enterprise can be significantly reduced, thereby achieving considerable energy-saving effects and economic benefits. Specifically, the following conclusions are obtained: (1) For the oxygen demand forecast, the prediction accuracy of the GABP model is better than that of the ARIMA model. The average MAPE of the 12 sets of data of the ARIMA and GABP models are 23.8% and 20.2%, respectively. (2) By comparing the scheduling results and the field data, it is found that after the scheduling, the amount of oxygen emission has decreased by 6.32%, the pipeline pressure has decreased by 0.61%, and the energy consumption of oxygen compression has decreased by 1.6%. Considering both the oxygen emission loss and the energy consumption of oxygen compression, the total power consumption of the oxygen system is reduced by 1.38%, which saves the electricity cost of about 9.03 million RMB per year.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

The transportation industry is rapidly transitioning from Internal Combustion Engine (ICE) based vehicles to Electric Vehicles (EVs) to promote clean energy. However, large-scale adoption of EVs can compromise the reliability of the power grids by introducing large uncertainty in the demand. Demand response with a controlled charge scheduling strategy for EVs can mitigate such issues. In this paper, a deep reinforcement learning- based charge scheduling strategy is developed for individual EVs by considering user’s dynamic driving behavior and charging preferences. The temporal dynamics of user’s anxiety about charging the EV battery is rigorously addressed. A dynamic weight allocation technique is applied to continuously tune user’s priority for charging and cost-saving with respect to charging duration. The sequential charging control problem is formulated as a Markov decision process, and an episodic approach to the deep deterministic policy gradient (DDPG) algorithm with target policy smoothing and delayed policy update techniques is applied to develop the optimal charge scheduling strategy. A real-world dataset that captures user’s driving behavior, such as arrival time, departure time, and charging duration, is utilized in this study. The extensive simulation results reveal the effectiveness of the proposed algorithm in minimizing energy cost while satisfying user’s charging requirements.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.