One of the most widespread multi-criteria decision-making methods is Analytic Hierarchy Process (AHP). AHP successfully combines pairwise comparisons method and hierarchical approach. It allows decision-maker to set priorities for all ranked alternatives. But what if, some them, their ranking value known (e.g., it can be determined differently)? The Heuristic Rating Estimation (HRE) proposed in...

The task of balancing of assembly lines is well-known in mass production system but this problem is NP-hard even for the simple straight line. Therefore, utilizing heuristic methods for these problems is totally unquestionable. Furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...

Background and Objectives: According to the random nature of heuristic algorithms, stability analysis of heuristic ensemble classifiers has particular importance. Methods: The novelty of this paper is using a statistical method consists of Plackett-Burman design, and Taguchi for the first time to specify not only important parameters, but also optimal levels for them. Minitab and Design Expert ...

A Two-phase model for configuring a cellular manufacturing system is proposed. In phase (I), for the first time, number of cells is considered as a decision variable. In phase (II), pursing two different objectives, one minimization of underload and the other, maximization of similarity of parts within a group, the design procedure is performed. As one cannot have these two objects together, a ...

the purpose of this study was to evaluate the web pages of islamic world science citation center (isc), the islamic countries sci using nielsen`s heuristic principles and was performed during september 2012. among nielsen`s 10 usability heuristic principles, five were covered. five professional evaluators were asked to evaluate the database using nielsen`s five criteria. the total average of se...

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.