Light-Weighted Decision Support Framework for Selecting Cloud Service Providers

作     者：Abdulmajeed Aljuhani Abdulaziz Alhubaishy Mohammad Khalid Imam Rahmani Ahmad A.Alzahrani 

作者机构：College of Computer Science and EngineeringTaibah UniversityMedina41411Saudi Arabia College of Computing and InformaticsSaudi Electronic UniversityRiyadh11673Saudi Arabia Computer ScienceCommon First Year DeanshipUmm-AlQura UniversityMakkahMKSaudi Arabia 

出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)

年 卷 期：2023年第74卷第2期

页      面：4293-4317页

核心收录：

学科分类：0831[工学-生物医学工程（可授工学、理学、医学学位）] 12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0805[工学-材料科学与工程（可授工学、理学学位）] 0701[理学-数学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 0801[工学-力学（可授工学、理学学位）] 

主　　题：Best worst method BWM cloud service provider decision support methods 

摘      要：Multi-criteria decision making(MCDM)is a technique used to achieve better outcomes for some complex business-related problems,whereby the selection of the best alternative can be made in as many cases as *** paper proposes a model,the multi-criteria decision support method,that allows both service providers and consumers to maximize their profits while preserving the best matching process for resource allocation and task *** increasing number of service providers with different service provision capabilities creates an issue for consumers seeking to select the best service *** consumer seeks a service provider based on various preferences,such as price,service quality,and time to complete the *** the literature,the problem is viewed from different perspectives,such as investigating how to enhance task scheduling and the resource allocation process,improve consumers’trust,and deal with network *** paper offers a novel model that considers the preferences of both service providers and consumers to find the best available service provider for each ***,the model adopts the best-worst method(BWM)to gather and prioritize tasks based on consumers’and service providers’***,the model calculates and matches similarities between the sets of tasks from the consumer’s side with the sets of tasks from the provider’s side to select the best service provider for each consumer using the two proposed *** complexity of the two algorithms is found to be O(n3).