Search published articles


Showing 7 results for Aryanezhad

R. Tavakkoli-Moghaddam, M. Aryanezhad, H. Kazemipoor , A. Salehipour ,
Volume 19, Issue 1 (International Journal of Engineering 2008)
Abstract

Abstract : A tandem automated guided vehicle (AGV) system deals with grouping workstations into some non-overlapping zones , and assigning exactly one AGV to each zone. This paper presents a new non-linear integer mathematical model to group n machines into N loops that minimizes both inter and intra-loop flows simultaneously. Due to computational difficulties of exact methods in solving our proposed model, a threshold accepting (TA) algorithm is proposed. To show its efficiency, a number of instances generated randomly are solved by this proposed TA and then compared with the LINGO solver package employing the branch-and-bound (B/B) method. The related computational results show that our proposed TA dominates the exact algorithm when the size of instances grows.

  


M.b Aryanezhad , A. Roghanian ,
Volume 19, Issue 1 (International Journal of Engineering 2008)
Abstract

Abstract: Bi-level programming, a tool for modeling decentralized decisions, consists of the objective(s) of the leader at its first level and that is of the follower at the second level. Three level programming results when second level is itself a bi-level programming. By extending this idea it is possible to define multi-level programs with any number of levels. Supply chain planning problems are concerned with synchronizing and optimizing multiple activities involved in the enterprise, from the start of the process, such as procurement of the raw materials, through a series of process operations, to the end, such as distribution of the final product to customers.  Enterprise-wide supply chain planning problems naturally exhibit a multi-level decision network structure, where for example, one level may correspond to a local plant control/scheduling/planning problem and another level to a corresponding plant-wide planning/network problem. Such a multi-level decision network structure can be mathematically represented by using “multi-level programming” principles. This paper studies a “bi-level linear multi-objective decision making” model in with “interval” parameters and presents a solution method for solving it this method uses the concepts of tolerance membership function and multi-objective multi-level optimization when all parameters are imprecise and interval .

  


M.b. Aryanezhad , E. M.b.Aryanezhad & E.roghanian ,
Volume 19, Issue 1 (International Journal of Engineering 2008)
Abstract

  Bi-level programming, a tool for modeling decentralized decisions, consists of the objective(s) of the leader at its first level and that is of the follower at the second level. Three level programming results when second level is itself a bi-level programming. By extending this idea it is possible to define multi-level programs with any number of levels. Supply chain planning problems are concerned with synchronizing and optimizing multiple activities involved in the enterprise, from the start of the process, such as procurement of the raw materials, through a series of process operations, to the end, such as distribution of the final product to customers.

  Enterprise-wide supply chain planning problems naturally exhibit a multi-level decision network structure, where for example, one level may correspond to a local plant control/scheduling/planning problem and another level to a corresponding plant-wide planning/network problem. Such a multi-level decision network structure can be mathematically represented by using “multi-level programming” principles. This paper studies a “bi-level linear multi-objective decision making” model in with “interval” parameters and presents a solution method for solving it this method uses the concepts of tolerance membership function and multi-objective multi-level optimization when all parameters are imprecise and interval .

 


S. G. Jalali Naini , M. B. Aryanezhad, A. Jabbarzadeh , H. Babaei ,
Volume 20, Issue 3 (IJIEPR 2009)
Abstract

This paper studies a maintenance policy for a system composed of two components, which are subject to continuous deterioration and consequently stochastic failure. The failure of each component results in the failure of the system. The components are inspected periodically and their deterioration degrees are monitored. The components can be maintained using different maintenance actions (repair or replacement) with different costs. Using stochastic regenerative properties of the system, a stochastic model is developed in order to analyze the deterioration process and a novel approach is presented that simultaneously determines the time between two successive inspection periods and the appropriate maintenance action for each of the components based on the observed degrees of deterioration. This approach considers different criteria like reliability and long-run expected cost of the system. A numerical example is provided in order to illustrate the implementation of the proposed approach.
S. J Sadjadi , Mir.b.gh. Aryanezhad , H.a. Sadeghi ,
Volume 20, Issue 3 (IJIEPR 2009)
Abstract

We present an improved implementation of the Wagner-Whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the Economic- Part-Period concept. The proposed method of this paper reduces the burden of the computations significantly in two different cases. We first assume there is no backlogging and inventory holding and set-up costs are fixed. The second model of this paper considers WWA when backlogging, inventory holding and set-up costs cannot be fixed. The preliminary results also indicate that the execution time for the proposed method is approximately linear in the number of periods in the planning-horizon .
R. Ramezanian, M.b. Aryanezhad , M. Heydari,
Volume 21, Issue 2 (IJIEPR 2010)
Abstract

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapted genetic algorithm based on bypass consideration to solve the problem. The basic parameters of this meta-heuristic are briefly discussed in this paper. Also a computational experiment is conducted to evaluate the performance of the implemented methods. The implemented algorithm can be used to solve large scale flow shop scheduling problem with bypass effectively .


Mir. B. Aryanezhad, M.j. Tarokh, M.n. Mokhtarian, F. Zaheri,
Volume 22, Issue 1 (IJIEPR 2011)
Abstract

  Multiple criteria decision making (MCDM) problem is one of the famous different kinds of decision making problems. In more cases in real situations, determining the exact values for MCDM problems is difficult or impossible. So, the values of alternatives with respect to the criteria or / and the values of criteria weights, are considered as fuzzy values (fuzzy numbers). In such conditions, the conventional crisp approaches for solving MCDM problems tend to be less effective for dealing with the imprecise or vagueness nature of the linguistic assessments. In this situation, the fuzzy MCDM methods are applied for solving MCDM problems. In this paper, we propose a fuzzy TOPSIS (for Order Preference by Similarity to Ideal Solution) method based on left and right scores for fuzzy MCDM problems. To show the applicability of the proposed method, two numerical examples are presented. As a result, our proposed method is precise, easy use and practical for solving MCDM problem with fuzzy data. Moreover, the proposed method considers the decision makers (DMs) preference in the decision making process. It seems that the proposed fuzzy TOPSIS method is flexible and easy to use and has a low computational volume .



Page 1 from 1     

© 2019 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb