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 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.

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.

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.

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.

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%.

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 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).

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.

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.

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.

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.

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 .

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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 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.

: 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.