Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/4158
Título: Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration
Autor: Ávila, Paulo
Costa, L.
Bastos, João
Lopes, P.
Data: 2010
Editora: IEEE
Relatório da Série N.º: Information Systems and Technologies (CISTI)
Resumo: The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.
Peer review: yes
URI: http://hdl.handle.net/10400.22/4158
ISBN: 978-1-4244-7227-7
Versão do Editor: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5556641&tag=1
Aparece nas colecções:ISEP – CIDEM – Artigos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
ART_PAvila_2010_CIDEM.pdf189,12 kBAdobe PDFVer/Abrir    Acesso Restrito. Solicitar cópia ao autor!


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.