Research on measurement method of resource service composition flexibility in service-oriented manufacturing system

2012 ◽  
Vol 25 (2) ◽  
pp. 113-135 ◽  
Author(s):  
H. Guo ◽  
F. Tao ◽  
L. Zhang ◽  
Y. J. Laili ◽  
D. K. Liu
2010 ◽  
Vol 139-141 ◽  
pp. 1451-1454 ◽  
Author(s):  
Hua Guo ◽  
Lin Zhang ◽  
Fei Tao ◽  
Lei Ren ◽  
Yong Liang Luo

In order to overcome the bottlenecks of traditional network manufacturing, a new service-oriented networked manufacturing model, i.e. the cloud manufacturing (CMfg), was proposed recently. As an effective method for the realization of the added value of manufacturing resource, resource service composition (RSC) plays an important role in the implementation of CMfg. In view of the issue of dynamic changes occurred during RSC in CMfg, this paper presents the concept of flexibility of RSC as well as the idea of optimal-selection of RSC based on flexibility, which can enable RSC to have the ability to adapt to the dynamic changes. Meantime, the measurement method of flexibility of RSC is investigated. The optimal-selection of RSC based on flexibility can be achieved through quantitative evaluation of flexibility.


2021 ◽  
Vol 7 ◽  
pp. e743
Author(s):  
Seyyed-Alireza Radmanesh ◽  
Alireza Haji ◽  
Omid Fatahi Valilai

Cloud manufacturing is a new globalized manufacturing framework which has improved the performance of manufacturing systems. The service-oriented architecture as the main idea behind this framework means that all resources and capabilities are considered as services. The agents interact by way of service exchanging, which has been a part of service composition research topics. Service allocations to demanders in a cloud manufacturing system have a dynamic behavior. However, the current research studies on cloud-based service composition are mainly based on centralized global optimization models. Therefore, a distributed deployment and real-time synchronization platform, which enables the globalized collaboration in service composition, is required. This paper proposes a method of using blockchain to solve these issues. Each service composition is considered as a transaction in the blockchain concept. A block includes a set of service compositions and its validity is confirmed by a predefined consensus mechanism. In the suggested platform, the mining role in blockchain is interpreted as an endeavor for proposing the proper service composition in the manufacturing paradigm. The proposed platform has interesting capabilities as it can increase the response time using the blockchain technology and improve the overall optimality of supply-demand matching in cloud manufacturing. The efficiency of the proposed model was evaluated by investigating a service allocation problem in a cloud manufacturing system in four large scale problems. Each problem is examined in four centralized modes, two, three and four solvers in blockchain-based model. The simulation results indicate the high quality of the proposed solution. The proposed solution will lead to at least 15.14% and a maximum of 34.8 percent reduction in costs and 20 to 68.4 percent at the solving time of the problem. It is also observed that with increasing the number of solvers (especially in problems with larger dimensions) the solution speed increases sharply (more than 68% improvement in some problems), which indicates the positive effect of distribution on reducing the problem-solving time.


2015 ◽  
Vol 2015 ◽  
pp. 1-13 ◽  
Author(s):  
Yongquan Xie ◽  
Zude Zhou ◽  
Duc Truong Pham ◽  
Wenjun Xu ◽  
Chunqian Ji

In order to realize an optimal resource service allocation in current open and service-oriented manufacturing model, multiuser resource service composition (RSC) is modeled as a combinational and constrained multiobjective problem. The model takes into account both subjective and objective quality of service (QoS) properties as representatives to evaluate a solution. The QoS properties aggregation and evaluation techniques are based on existing researches. The basic Bees Algorithm is tailored for finding a near optimal solution to the model, since the basic version is only proposed to find a desired solution in continuous domain and thus not suitable for solving the problem modeled in our study. Particular rules are designed for handling the constraints and finding Pareto optimality. In addition, the established model introduces a trusted service set to each user so that the algorithm could start by searching in the neighbor of more reliable service chains (known as seeds) than those randomly generated. The advantages of these techniques are validated by experiments in terms of success rate, searching speed, ability of avoiding ingenuity, and so forth. The results demonstrate the effectiveness of the proposed method in handling multiuser RSC problems.


2008 ◽  
Vol 50 (2) ◽  
Author(s):  
Shahram Dustdar ◽  
Mike P. Papazoglou

SummaryIn this overview paper, we discuss the basic principles underlying service-oriented computing in general, and (Web) services in particular. We discuss the important differences between (Web) services and Web applications and other models in Internet computing. Finally, we discuss where we see the future research challenges in the area of service composition.


Sign in / Sign up

Export Citation Format

Share Document