This paper discussed the scheduling problem of outpatients in a radiology center with an emphasis on priority. To more compatibility to real-world conditions, we assume that the elapsed times in different stages to be uncertain that follow from the specific distribution function. The objective is to minimize outpatients’ total spent time in a radiology center. The problem is formulated as a fle...

in this paper, we introduce a satisfaction function (sf) to compare interval values on the basis oftseng and klein’s idea. the sf estimates the degree to which arithmetic comparisons between two intervalvalues are satisfied. then, we define two other functions called lower and upper sf based on the sf. weapply these functions in order to present a new interpretation of inequality constraints wi...

In this paper we use interior-point methods for linear programming, developed in t,he contest of sequential computation, to obtain a parallel algorithm for t,he bipartite matching problem. Our algorithm runs in 0*(,/E) time I. Our results extend to the weighted bipartite matching problem and to the zero-one minimum-cost flow problem, yielding O*( filog C’) algorithms?. This improvk’previous bou...

in this paper we propose a simple non-parametric model for multiple crite-ria supplier selection problem. the proposed model does not generate a zeroweight for a certain criterion and ranks the suppliers without solving the modeln times (one linear programming (lp) for each supplier) and therefore allowsthe manager to get faster results. the methodology is illustrated using anexample.

This paper uses the L1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (WDSND) vectorsof a multi-objective mixed integer linear programming (MOMILP) problem.The proposed method generalizes the proposed approach by Tohidi and Razavyan[Tohidi G., S. Razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent...