Scenario Analysis of Web Service Composition based on Multi-Criteria Mathematical Goal Programming

LiYing Cui (), Soundar Kumara () and Dongwon Lee ()
Additional contact information
LiYing Cui: Product Supply and Operations, KC International, Kimberly-Clark, 1400 Holcomb Bridge Rd, Roswell, GA 300076, USA
Soundar Kumara: Department of Industrial Engineering, The Pennsylvania State University, 310 Leonhard Building, University Park, PA 16802, USA
Dongwon Lee: College of Information Sciences and Technology, The Pennsylvania State University, 313A INFO SCI and TECH Building, University Park, PA 16802, USA

Service Science, 2011, vol. 3, issue 4, 280-303

Abstract: This paper addresses the web service composition problem considering multi-criteria regarding quality of services (QoS). Three different scenarios of multi-criteria mathematical programming models are explored under the framework of network based analysis in web service composition. This work takes care of the issues pertaining to inputs and outputs matching of web services and Quality-of-Service (QoS) at the same time. The multi-criteria programming models are explored to select the desirable service composition in a variety of categories in accordance with customers' preferences in three different scenarios: (1) Optimal, (2) Compromised optimal, and (3) Acceptable. This set of multi-criteria models have both advantages and disadvantages comparing with each other, and can be used as different solvers in the network based service composition framework. The proposed regular multi-criteria programming (MCP) models are used in Scenario (1): Optimal. The proposed multi-criteria goal programming for optimal composition (MCGPO) and multi-criteria goal programming for non-optimal solution (MCGPN) models are designed for Scenarios (2): Compromised optimal and (3) Acceptable respectively. And they can find a compromised composition based on the trade-off of customer's preference on the QoS goals in case that the optimal composition satisfying both functional and QoS constraints does not exist in the network. [ Service Science , ISSN 2164-3962 (print), ISSN 2164-3970 (online), was published by Services Science Global (SSG) from 2009 to 2011 as issues under ISBN 978-1-4276-2090-3.]

Keywords: web service; service composition; multi-criteria mathematical programming; goal programming; manufacturing; enterprise integration (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/serv.3.4.280 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orserv:v:3:y:2011:i:4:p:280-303

Access Statistics for this article

More articles in Service Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().