Mohsen Salehi

Cost-oriented two-sided assembly line balancing problem: A simulated annealing approach

Two-sided assembly line balancing problems usually occur in plants producing large-sized high-volume products such as automobiles, buses or trucks. The difference between these kinds of assembly lines and traditional assembly lines is that there is the possibility of installing two parallel single stations in each position of the line so that the workers can work simultaneously on different tasks of one same product. In this paper, the cost-oriented two-sided assembly line balancing problem is addressed. This kind of assembly line balancing problem usually occurs in final assembly of products in which the manufacturing process is very labour intensive. A mix integer programming is proposed to solve the problem optimally. Since the problem is well known as NP (nondeterministic polynomial-time)-hard, a heuristic algorithm based on simulated annealing approach is developed to solve the medium- and large-size scales of this problem. Through computational experiments, the performance of the proposed heuristic approach is examined. The experimental results validate the effectiveness and efficiency of the proposed algorithm.

A New Graph-Based Algorithm for Persian Text Summarization

Nowadays, with increasing volume of electronic text information, the need for production of summary systems becomes essential. Summary systems capture and summarize the most important concepts of the documents and help the user to go through the main points of the text faster and make the processing of information much easier. An important class of such systems is the ones that produce extractive summaries. This summary is produced by selecting most important parts of the document without doing any modification on the main text. One approach for producing this kind of summary is using the graph theory. In this paper a new algorithm based on the graph theory is introduced to select the most important sentences of the document. In this algorithm the nodes and edges will be assigned with different weights and then the final weight of each one will be defined by combining these values. This final weight indicates the importance of the sentence and the probability of appearing this sentence in the final summary. The results show that considering simultaneous different criteria generate a summary which is more similar to human one.

MLBLM: a multi-level load balancing mechanism in agent-based grid

A computational grid is a widespread computing environment that provides huge computational power for large-scale distributed applications. Load balancing, has a considerable effect on the grid middleware performance. Current load balancing methods cannot satisfy all necessities for the grid. In this paper, a Multi-level Load Balancing Method (MLBM) is proposed. Cooperation among different levels in this method, removes disadvantages of each level, while satisfy most of load balancing requirements needed. Simulation results indicate that this new mechanism surpasses its predecessors in increasing efficiency and decreasing communication overhead.

An Optimal Job Selection Method in Load Balancing Algorithms of Economical Grids

it A computational grid is a widespread computing environment that provides huge computational power for large-scale distributed applications. Load balancing, has a considerable effect on the grid middleware performance. Load-balancing algorithm and job selection are two parts of any load balancing methods in the grid. In the previous work we had proposed a Load-balancing algorithm for the grid environment. In this paper, we intend to complete the load-balancing algorithm by proposing an optimal job selection algorithm. As selecting jobs is a multi-criteria problem in nature, we define the job selection algorithm as an optimization problem and solve it using GA. The performance and the optimality of the method is proved by relevant simulations and experimental results.