A chaos control optimal algorithm for QoS-based service composition selection in cloud manufacturing system

Robustness of Cloud Manufacturing System Based on Complex Network and Multi-Agent Simulation

Cloud manufacturing systems (CMSs) are networked, distributed and loosely coupled, so they face great uncertainty and risk. This paper combines the complex network model with multi-agent simulation in a novel approach to the robustness analysis of CMSs. Different evaluation metrics are chosen for the two models, and three different robustness attack strategies are proposed. To verify the effectiveness of the proposed method, a case study is then conducted on a cloud manufacturing project of a new energy vehicle. The results show that both the structural and process-based robustness of the system are lowest under the betweenness-based failure mode, indicating that resource nodes with large betweenness are most important to the robustness of the project. Therefore, the cloud manufacturing platform should focus on monitoring and managing these resources so that they can provide stable services. Under the individual server failure mode, system robustness varies greatly depending on the failure behavior of the service provider: Among the five service providers (S1-S5) given in the experimental group, the failure of Server 1 leads to a sharp decline in robustness, while the failure of Server 2 has little impact. This indicates that the CMS can protect its robustness by identifying key servers and strengthening its supervision of them to prevent them from exiting the platform.

Bibliometric Method for Manufacturing Servitization: A Review and Future Research Directions

To gain sustainable development, it is a trend that manufacturing companies are change the value chain from manufacturing-centric to service-centric. Therefore, the capability of the manufacturing service is as significant as the production ability of enterprises, which reflects the supply chain management (SCM), flexible production, production efficiency, and other indicators of the enterprises. It is the first paper to discuss the sustainability of service-oriented manufacturing using bibliometric analysis. It derives a detailed review and future outlook on the development of manufacturing servitization, indicating the research directions for future development, and provides a valuable reference for researchers in related directions. The bibliometric analysis discusses countries or regions, research areas, authors, keywords, institutions, and journals based on the literature data from the Web of Science (WoS). The results show that research on manufacturing services has gradually received attention since its inception and has become popular since 2008. The papers published from 2008 to 2021 account for 77.62%. The USA is the most studied country on this topic, followed by China and the UK. The International Journal of Production Research regarding the most quantity of articles, and Beihang University is the most influential institution in this field. The largest amount of articles published in the area of “business and economics”, amounting to 1565 articles. In recent years, the main research areas included “Industry 4.0”, “cloud manufacturing (CMfg)”, “Internet of Things (IoT)”, “big data” and “services innovation”. Finally, “digital and intelligent manufacturing” and “product-service systems” are potential research directions for the future.

A Two-Phase Machine Learning Framework for Context-Aware Service Selection to Empower People with Disabilities

The use of software and IoT services is increasing significantly among people with special needs, who constitute 15% of the world's population. However, selecting appropriate services to create a composite assistive service based on the evolving needs and context of disabled user groups remains a challenging research endeavor. Our research applies a scenario-based design technique to contribute (1) an inclusive disability ontology for assistive service selection, (2) semi-synthetic generated disability service datasets, and (3) a machine learning (ML) framework to choose services adaptively to suit the dynamic requirements of people with special needs. The ML-based selection framework is applied in two complementary phases. In the first phase, all available atomic tasks are assessed to determine their appropriateness to the user goal and profiles, whereas in the subsequent phase, the list of service providers is narrowed by matching their quality-of-service factors against the context and characteristics of the disabled person. Our methodology is centered around a myriad of user characteristics, including their disability profile, preferences, environment, and available IT resources. To this end, we extended the widely used QWS V2.0 and WS-DREAM web services datasets with a fusion of selected accessibility features. To ascertain the validity of our approach, we compared its performance against common multi-criteria decision making (MCDM) models, namely AHP, SAW, PROMETHEE, and TOPSIS. The findings demonstrate superior service selection accuracy in contrast to the other methods while ensuring accessibility requirements are satisfied.

Quantifying SWOT analysis for cloud adoption using FAHP-DEMATEL approach: evidence from the manufacturing sector

Purpose

This study aims to identify the critical factors (barriers and drivers) influencing the adoption of cloud computing (ACC) in the manufacturing sector in India.

Design/methodology/approach

In this study, a mixed methodology approach is used. Interviews are conducted to investigate factors (drivers and barriers) influencing the ACC, which are further categorized as controllable determinants (weaknesses and strengths) and uncontrollable determinants (threats and opportunities) using a SWOT analysis. Fuzzy analytic hierarchy process (FAHP) has been utilized to highlight the most critical drivers as well as barriers. Finally, decision-making trial and evaluation laboratory (DEMATEL) has been used to find the cause-effect relationships among factors and their influence on the decision of adoption.

Findings

The manufacturing sector is in the digital and value change transformation phase with Industry 4.0, that is, the next industrial revolution. The 24 critical factors influencing ACC are subdivided into strengths, weaknesses, opportunities and threats. The FAHP analysis ranked time to market, competitive advantage, business agility, data confidentiality and lack of government policy standards as the most critical factors. The cause-effect relationships highlight that time to market is the most significant causal factor, and resistance to technology is the least significant effect factor. The results of the study elucidate that the strengths of ACC are appreciably more than its weaknesses.

Research limitations/implications

This study couples the technology acceptance model (TAM) with technology-organization-environment (TOE) framework and adds an economic perspective to examine the significant influences of ACC in the Indian manufacturing sector. Further, it contributes to the knowledge of ACC in general and provides valuable insights into interrelationships among factors influencing the decision and strategies of adoption in particular.

Originality/value

This is the first scholarly work in the Indian manufacturing sector that uses the analysis from SWOT and FAHP approach as a base for identifying cause-effect relationships between the critical factors influencing ACC. Further, based on the extant literature and analysis of this work, an adoption framework has been proposed that justifies that ACC is not just a technological challenge but is also an environmental, economic and organizational challenge that includes organizational issues, costs and need for adequate government policies.

Multi-Objective Cloud Manufacturing Service Selection and Scheduling with Different Objective Priorities

In recent years, with the support of new information technology and national policies, cloud manufacturing (CMfg) has developed rapidly in China. About CMfg, scholars have conducted extensive and in-depth research, among which multi-objective service selection and scheduling (SSS) attracts increasing attention. Generally, the objectives of the SSS problem involve several aspects, such as time, cost, environment and quality. In order to select an optimal solution, the preference of a decision maker (DM) becomes key information. As one kind of typical preference information, objective priorities are less considered in current studies. So, in this paper, a multi-objective model is first constructed for the SSS with different objective priorities. Then, a two-phase method based on the order of priority satisfaction (TP-OPS) is designed to solve this problem. Finally, computational experiments are conducted for problems with different services and tasks/subtasks, as well as different preference information. The results show that the proposed TP-OPS method can achieve a balance between the maximum comprehensive satisfaction and satisfaction differences, which is conducive to the sustainable development of CMfg. In addition, the proposed method allows the preference information to be gradually clarified, which has the advantage of providing convenience to DM.

Multi-Objective Service Selection and Scheduling with Linguistic Preference in Cloud Manufacturing

Service management in cloud manufacturing (CMfg), especially the service selection and scheduling (SSS) problem has aroused general attention due to its broad industrial application prospects. Due to the diversity of CMfg services, SSS usually need to take into account multiple objectives in terms of time, cost, quality, and environment. As one of the keys to solving multi-objective problems, the preference information of decision maker (DM) is less considered in current research. In this paper, linguistic preference is considered, and a novel two-phase model based on a desirable satisfying degree is proposed for solving the multi-objective SSS problem with linguistic preference. In the first phase, the maximum comprehensive satisfying degree is calculated. In the second phase, the satisfying solution is obtained by repeatedly solving the model and interaction with DM. Compared with the traditional model, the two-phase is more effective, which is verified in the calculation experiment. The proposed method could offer useful insights which help DM balance multiple objectives with linguistic preference and promote sustainable development of CMfg.

Network Location-Aware Service Recommendation with Random Walk in Cyber-Physical Systems

Cyber-physical systems (CPS) have received much attention from both academia and industry. An increasing number of functions in CPS are provided in the way of services, which gives rise to an urgent task, that is, how to recommend the suitable services in a huge number of available services in CPS. In traditional service recommendation, collaborative filtering (CF) has been studied in academia, and used in industry. However, there exist several defects that limit the application of CF-based methods in CPS. One is that under the case of high data sparsity, CF-based methods are likely to generate inaccurate prediction results. In this paper, we discover that mining the potential similarity relations among users or services in CPS is really helpful to improve the prediction accuracy. Besides, most of traditional CF-based methods are only capable of using the service invocation records, but ignore the context information, such as network location, which is a typical context in CPS. In this paper, we propose a novel service recommendation method for CPS, which utilizes network location as context information and contains three prediction models using random walking. We conduct sufficient experiments on two real-world datasets, and the results demonstrate the effectiveness of our proposed methods and verify that the network location is indeed useful in QoS prediction.

Fast and Epsilon-Optimal Discretized Pursuit Learning Automata

Learning automata (LA) are powerful tools for reinforcement learning. A discretized pursuit LA is the most popular one among them. During an iteration its operation consists of three basic phases: 1) selecting the next action; 2) finding the optimal estimated action; and 3) updating the state probability. However, when the number of actions is large, the learning becomes extremely slow because there are too many updates to be made at each iteration. The increased updates are mostly from phases 1 and 3. A new fast discretized pursuit LA with assured ε -optimality is proposed to perform both phases 1 and 3 with the computational complexity independent of the number of actions. Apart from its low computational complexity, it achieves faster convergence speed than the classical one when operating in stationary environments. This paper can promote the applications of LA toward the large-scale-action oriented area that requires efficient reinforcement learning tools with assured ε -optimality, fast convergence speed, and low computational complexity for each iteration.