A sharing-oriented service selection and scheduling approach for the optimization of resource utilization

2011 ◽  
Vol 6 (1) ◽  
pp. 15-32 ◽  
Author(s):  
Zhongjie Wang ◽  
Xiaofei Xu
2019 ◽  
Vol 11 (9) ◽  
pp. 2619 ◽  
Author(s):  
Wei He ◽  
Guozhu Jia ◽  
Hengshan Zong ◽  
Jili Kong

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.


2019 ◽  
Vol 11 (17) ◽  
pp. 4767 ◽  
Author(s):  
He ◽  
Jia ◽  
Zong ◽  
Huang

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.


Mathematics ◽  
2021 ◽  
Vol 9 (17) ◽  
pp. 2023
Author(s):  
Issam Alhadid ◽  
Sufian Khwaldeh ◽  
Mohammad Al Rawajbeh ◽  
Evon Abu-Taieh ◽  
Ra’ed Masa’deh ◽  
...  

Service-oriented architecture (SOA) has emerged as a flexible software design style. SOA focuses on the development, use, and reuse of small, self-contained, independent blocks of code called web services that communicate over the network to perform a certain set of simple tasks. Web services are integrated as composite services to offer complex tasks and to provide the expected services and behavior in addition to fulfilling the clients’ requests according to the service-level agreement (SLA). Web service selection and composition problems have been a significant area of research to provide the expected quality of service (QoS) and to meet the clients’ expectations. This research paper presents a hybrid web service composition model to solve web service selection and composition problems and to optimize web services’ resource utilization using k-means clustering and knapsack algorithms. The proposed model aims to maximize the service compositions’ QoS and minimize the number of web services integrated within the service composition using the knapsack algorithm. Additionally, this paper aims to track the service compositions’ QoS attributes by evaluating and tracking the web services’ QoS using the reward function and, accordingly, use the k-means algorithm to decide to which cluster the web service belongs. The experimental results on a real dataset show the superiority and effectiveness of the proposed algorithm in comparison with the results of the state–action–reward–state–action (SARSA) and multistage forward search (MFS) algorithms. The experimental results show that the proposed model reduces the average time of the web service selection and composition processes to 37.02 s in comparison to 47.03 s for the SARSA algorithm and 42.72 s for the MFS algorithm. Furthermore, the average of web services’ resource utilization results increased by 4.68% using the proposed model in comparison to the resource utilization by the SARSA and MFS algorithms. In addition, the experimental results showed that the average number of service compositions using the proposed model improved by 26.04% compared with the SARSA and MFS algorithms.


2006 ◽  
Vol 175 (4S) ◽  
pp. 4-4
Author(s):  
Gurkirpal Singh ◽  
Smriti Malla ◽  
Huijian Wang ◽  
Harcharan Gill ◽  
Kristijian H. Kahler ◽  
...  

2004 ◽  
Vol 171 (4S) ◽  
pp. 35-35
Author(s):  
Brent K. Hollenbeck ◽  
David C. Miller ◽  
Rodney L. Dunn ◽  
Willie Underwood ◽  
Shukri F. Khuri ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document