An alternative formulation for the fuzzy assignment problem / A. Emrouznejad in Journal of the operational research society (JORS), Vol. 63 N° 1 (Janvier 2012)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 63 N° 1 (Janvier 2012) . - pp. 59–63 Titre : An alternative formulation for the fuzzy assignment problem Type de document : texte imprimé Auteurs : A. Emrouznejad, Auteur ; M. L. Zerafat Angiz, Auteur ; W. Ho, Auteur Année de publication : 2012 Article en page(s) : pp. 59–63 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Assignment problem Fuzzy data Data envelopment analysis Index. décimale : 001.424 Résumé : The existing assignment problems for assigning n jobs to n individuals are limited to the considerations of cost or profit measured as crisp. However, in many real applications, costs are not deterministic numbers. This paper develops a procedure based on Data Envelopment Analysis method to solve the assignment problems with fuzzy costs or fuzzy profits for each possible assignment. It aims to obtain the points with maximum membership values for the fuzzy parameters while maximizing the profit or minimizing the assignment cost. In this method, a discrete approach is presented to rank the fuzzy numbers first. Then, corresponding to each fuzzy number, we introduce a crisp number using the efficiency concept. A numerical example is used to illustrate the usefulness of this new method. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n1/abs/jors201114a.html [article] An alternative formulation for the fuzzy assignment problem [texte imprimé] / A. Emrouznejad, Auteur ; M. L. Zerafat Angiz, Auteur ; W. Ho, Auteur . - 2012 . - pp. 59–63. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 1 (Janvier 2012) . - pp. 59–63 Mots-clés : Assignment problem Fuzzy data Data envelopment analysis Index. décimale : 001.424 Résumé : The existing assignment problems for assigning n jobs to n individuals are limited to the considerations of cost or profit measured as crisp. However, in many real applications, costs are not deterministic numbers. This paper develops a procedure based on Data Envelopment Analysis method to solve the assignment problems with fuzzy costs or fuzzy profits for each possible assignment. It aims to obtain the points with maximum membership values for the fuzzy parameters while maximizing the profit or minimizing the assignment cost. In this method, a discrete approach is presented to rank the fuzzy numbers first. Then, corresponding to each fuzzy number, we introduce a crisp number using the efficiency concept. A numerical example is used to illustrate the usefulness of this new method. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n1/abs/jors201114a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire

Finding relevant search engines results / G. R. Amin in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1144–1150 Titre : Finding relevant search engines results : a minimax linear programming approach Type de document : texte imprimé Auteurs : G. R. Amin, Auteur ; A. Emrouznejad, Auteur Année de publication : 2011 Article en page(s) : pp. 1144–1150 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Linear programming Search engine Metasearch Relevancy index Index. décimale : 001.424 Résumé : For a submitted query to multiple search engines finding relevant results is an important task. This paper formulates the problem of aggregation and ranking of multiple search engines results in the form of a minimax linear programming model. Besides the novel application, this study detects the most relevant information among a return set of ranked lists of documents retrieved by distinct search engines. Furthermore, two numerical examples aree used to illustrate the usefulness of the proposed approach. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200953a.html [article] Finding relevant search engines results : a minimax linear programming approach [texte imprimé] / G. R. Amin, Auteur ; A. Emrouznejad, Auteur . - 2011 . - pp. 1144–1150. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1144–1150 Mots-clés : Linear programming Search engine Metasearch Relevancy index Index. décimale : 001.424 Résumé : For a submitted query to multiple search engines finding relevant results is an important task. This paper formulates the problem of aggregation and ranking of multiple search engines results in the form of a minimax linear programming model. Besides the novel application, this study detects the most relevant information among a return set of ranked lists of documents retrieved by distinct search engines. Furthermore, two numerical examples aree used to illustrate the usefulness of the proposed approach. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200953a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire