The classification of fuzzy data is considered as the most challenging areas of data analysis and the complexity of the procedures has been obstacle to the development of new methods for fuzzy data analysis. However, there are significant advances in modeling systems in which fuzzy data are available in the field of mathematical programming. In order to exploit the results of the researches on ...

data envelopment analysis (dea) is a mathematical programming method in operations research that can be used to distinguish between efficient and inefficient decision making units (dmus). however, the conventional dea models do not have the ability to rank the efficient dmus. this article suggests bootstrapping method for ranking measures of technical efficiency as calculated via non-radial mod...

The scarcity of water resources and supply resources limitation, have caused an increasing gap between water supply and demand specially in recent decades in almost all regions of the globe. One of the best known solutions proposed by the economists is using the different water pricing approaches thereby obtaining the optimal allocation and social justice. To this purpose, this paper uses the p...

In this paper, a comprehensive mathematical model for designing an electric power supply chain network via considering preventive maintenance under risk of network failures is proposed. The risk of capacity disruption of the distribution network is handled via using a two-stage stochastic programming as a framework for modeling the optimization problem. An applied method of planning for the net...

Mathematical programming and artificial intelligence (AI) methods are known as the most effective and applicable procedures to form manufacturing cells in designing a cellular manufacturing system (CMS). In this paper, a bi-objective programming model is presented to consider the cell formation problem that is solved by a proposed multi-objective particle swarm optimization (MOPSO). The model c...

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...