Cloud computing resource scheduling and a survey of its evolutionary approaches

A disruptive technology fundamentally transforming the way that computing services are delivered, cloud computing offers information and communication technology users a new dimension of convenience of resources, as services via the Internet. Because cloud provides a finite pool of virtualized on-demand resources, optimally scheduling them has become an essential and rewarding topic, where a trend of using Evolutionary Computation (EC) algorithms is emerging rapidly. Through analyzing the cloud computing architecture, this survey first presents taxonomy at two levels of scheduling cloud resources. It then paints a landscape of the scheduling problem and solutions. According to the taxonomy, a comprehensive survey of state-of-the-art approaches is presented systematically. Looking forward, challenges and potential future research directions are investigated and invited, including real-time scheduling, adaptive dynamic scheduling, large-scale scheduling, multiobjective scheduling, and distributed and parallel scheduling. At the dawn of Industry 4.0, cloud computing scheduling for cyber-physical integration with the presence of big data is also discussed. Research in this area is only in its infancy, but with the rapid fusion of information and data technology, more exciting and agenda-setting topics are likely to emerge on the horizon

Adaptive Multi-Priority Rule Approach To Control Agile Disassembly Systems In Remanufacturing

End-of-Life (EOL) products in remanufacturing are prone to a high degree of uncertainty in terms of product quantity and quality. Therefore, the industrial shift towards a circular economy emphasizes the need for agile and hybrid disassembly systems. These systems feature a dynamic material flow. Besides that, they combine the endurance of robots with the dexterity of human operators for an effective and economically reasonable EOL-product treatment. Moreover, being reconfigurable, agile disassembly systems allow an alignment of their functional and quantitative capacity to volatile production programs. However, changes in both the system configuration and the production program to be processed call for adaptive approaches to production control. This paper proposes a multi-priority rule heuristic combined with an optimization tool for adaptive re-parameterization. First, domain-specific priority rules are introduced and incorporated into a weighted priority function for disassembly task allocation. Besides that, a novel metaheuristic parameter optimizer is devised to facilitate the adaption of weights in response to evolving requirements in a reasonable timeframe. Different metaheuristics such as simulated annealing or particle swarm optimization are incorporated as black-box optimizers. Subsequently, the performance of these metaheuristics is meticulously evaluated across six distinct test cases, employing discrete event simulation for evaluation, with a primary focus on measuring both speed and solution quality. To gauge the efficacy of the approach, a robust set of weights is employed as a benchmark. Encouragingly, the results of the experimentation reveal that the metaheuristics exhibit a notable proficiency in rapidly identifying high-quality solutions. The results are promising in that the metaheuristics can quickly find reasonable solutions, thus illustrating the compelling potential in enhancing the efficiency of agile disassembly systems

Adaptive Multi-Priority Rule Approach To Control Agile Disassembly Systems In Remanufacturing

End-of-Life (EOL) products in remanufacturing are prone to a high degree of uncertainty in terms of product quantity and quality. Therefore, the industrial shift towards a circular economy emphasizes the need for agile and hybrid disassembly systems. These systems feature a dynamic material flow. Besides that, they combine the endurance of robots with the dexterity of human operators for an effective and economically reasonable EOL-product treatment. Moreover, being reconfigurable, agile disassembly systems allow an alignment of their functional and quantitative capacity to volatile production programs. However, changes in both the system configuration and the production program to be processed call for adaptive approaches to production control. This paper proposes a multi-priority rule heuristic combined with an optimization tool for adaptive re-parameterization. First, domain-specific priority rules are introduced and incorporated into a weighted priority function for disassembly task allocation. Besides that, a novel metaheuristic parameter optimizer is devised to facilitate the adaption of weights in response to evolving requirements in a reasonable timeframe. Different metaheuristics such as simulated annealing or particle swarm optimization are incorporated as black-box optimizers. Subsequently, the performance of these metaheuristics is meticulously evaluated across six distinct test cases, employing discrete event simulation for evaluation, with a primary focus on measuring both speed and solution quality. To gauge the efficacy of the approach, a robust set of weights is employed as a benchmark. Encouragingly, the results of the experimentation reveal that the metaheuristics exhibit a notable proficiency in rapidly identifying high-quality solutions. The results are promising in that the metaheuristics can quickly find reasonable solutions, thus illustrating the compelling potential in enhancing the efficiency of agile disassembly systems

Bio-inspired multi-agent systems for reconfigurable manufacturing systems

The current market’s demand for customization and responsiveness is a major challenge for producing intelligent, adaptive manufacturing systems. The Multi-Agent System (MAS) paradigm offers an alternative way to design this kind of system based on decentralized control using distributed, autonomous agents, thus replacing the traditional centralized control approach. The MAS solutions provide modularity, flexibility and robustness, thus addressing the responsiveness property, but usually do not consider true adaptation and re-configuration. Understanding how, in nature, complex things are performed in a simple and effective way allows us to mimic nature’s insights and develop powerful adaptive systems that able to evolve, thus dealing with the current challenges imposed on manufactur- ing systems. The paper provides an overview of some of the principles found in nature and biology and analyses the effectiveness of bio-inspired methods, which are used to enhance multi-agent systems to solve complex engineering problems, especially in the manufacturing field. An industrial automation case study is used to illustrate a bio-inspired method based on potential fields to dynamically route pallets

Dynamic Scheduling for Maintenance Tasks Allocation supported by Genetic Algorithms

Since the first factories were created, man has always tried to maximize its production and, consequently, his profits. However, the market demands have changed and nowadays is not so easy to get the maximum yield of it. The production lines are becoming more flexible and dynamic and the amount of information going through the factory is growing more and more. This leads to a scenario where errors in the production scheduling may occur often. Several approaches have been used over the time to plan and schedule the shop-floor’s production. However, some of them do not consider some factors present in real environments, such as the fact that the machines are not available all the time and need maintenance sometimes. This increases the complexity of the system and makes it harder to allocate the tasks competently. So, more dynamic approaches should be used to explore the large search spaces more efficiently. In this work is proposed an architecture and respective implementation to get a schedule including both production and maintenance tasks, which are often ignored on the related works. It considers the maintenance shifts available. The proposed architecture was implemented using genetic algorithms, which already proved to be good solving combinatorial problems such as the Job-Shop Scheduling problem. The architecture considers the precedence order between the tasks of a same product and the maintenance shifts available on the factory. The architecture was tested on a simulated environment to check the algorithm behavior. However, it was used a real data set of production tasks and working stations

Adaptive scheduling based on self-organized holonic swarm of schedulers

Scheduling plays an important role in the companies’ competiveness, dealing with complex combinatorial problems subject to uncertainty and emergence. In particular, in the ramp-up phase of small lot-sizes of complex products, scheduling is more demanding, e.g. due to late requests and immature technology products and processes. This paper presents the principles of a distributed scheduling architecture based on holonic and swarm principles and implemented using multi-agent system technology. In particular, it is described the coordination among the network of the swarm of schedulers and analysed the impact of embedded self-organization mechanisms.The research leading to these results has received funding from the European Union Seventh Framework Programme FP7 ARUM project, under grant agreement n° 314056.info:eu-repo/semantics/publishedVersio

Resolving forward-reverse logistics multi-period model using evolutionary algorithms

© 2016 Elsevier Ltd In the changing competitive landscape and with growing environmental awareness, reverse logistics issues have become prominent in manufacturing organizations. As a result there is an increasing focus on green aspects of the supply chain to reduce environmental impacts and ensure environmental efficiency. This is largely driven by changes made in government rules and regulations with which organizations must comply in order to successfully operate in different regions of the world. Therefore, manufacturing organizations are striving hard to implement environmentally efficient supply chains while simultaneously maximizing their profit to compete in the market. To address the issue, this research studies a forward-reverse logistics model. This paper puts forward a model of a multi-period, multi-echelon, vehicle routing, forward-reverse logistics system. The network considered in the model assumes a fixed number of suppliers, facilities, distributors, customer zones, disassembly locations, re-distributors and second customer zones. The demand levels at customer zones are assumed to be deterministic. The objective of the paper is to maximize the total expected profit and also to obtain an efficient route for the vehicle corresponding to an optimal/near optimal solution. The proposed model is resolved using Artificial Immune System (AIS) and Particle Swarm Optimization (PSO) algorithms. The findings show that for the considered model, AIS works better than the PSO. This information is important for a manufacturing organization engaged in reverse logistics programs and in running units efficiently. This paper also contributes to the limited literature on reverse logistics that considers costs and profit as well as vehicle route management

Production Scheduling Requirements to Smart Manufacturing

The production scheduling has attracted a lot of researchers for many years, however most of the approaches are not targeted to deal with real manufacturing environments, and those that are, are very particular for the case study. It is crucial to consider important features related with the factories, such as products and machines characteristics and unexpected disturbances, but also information such as when the parts arrive to the factory and when should be delivered. So, the purpose of this paper is to identify some important characteristics that have been considered independently in a lot of studies and that should be considered together to develop a generic scheduling framework to be used in a real manufacturing environment.authorsversionpublishe