Farhad Tari

Sharif University of Technology | SHARIF · Department of Industrial Engineering

A B S T RAC T Multi-criteria sequence dependent setup times scheduling problems exist almost everywhere in real modern manufacturing world environments. Among them, Sequence Dependent Setup Times -Multi-Objective Hybrid Flowshop Scheduling Problem (SDST-MOHFSP) has been an intensifying attention of researchers and practitioners in the last three d...

This paper presents a facility layout design for a cellular manufacturing system (CMS), with the automated guided vehicles (AGVs) as the transportation device, to minimize the total material handling costs. A new concept of assigning the workstations to the non-overlapping closed zones, by which independent AGVs are allocated for internal transfer...

The problem of allocating different types of vehicles for transporting a set of products in an existing transportation network, to minimize the total transportation costs, is considered. The distribution network involves a heterogeneous fleet of vehicles each with the given capacity and with a variable transportation cost and a fixed cost with a di...

The problem of allocating heterogeneous fleet of vehicles to the existing distribution network for dispensing products from a manufacturing firm to a set of depots is considered. It is assumed a heterogeneous fleet of vehicles with the given capacities and total costs consisting of a discounted fixed cost and a variable cost proportional to the amo...

We propose a first depth dual approach branch and bound (B&B) routine for solving the general form of multi-dimensional multiple-choice knapsack problems (MMKPs).We call this approach a discriminatory branch and bound method. This name is chosen due to the selection of a node for further branching based on a discriminatory criterion. Three selectio...

An effective facility layout implies that departments with high flow are laid adjacent. However, in the case of a very narrow boundary length between the neighbouring departments, the adjacency would actually be useless. In traditional layout design methods, a score is generally assigned independent of the department’s boundary length. This may res...

In this document, allocation of different types of vehicles for transporting products from a manufacturing firm to its depots is considered. The problem involves a limited number of vehicles of various capacities, with the fixed and variable costs as well as a discount mechanism. The objective is defined as the minimisation of the total transportat...

Abstract - In this paper a generalized version of the tardiness flowshop permutation scheduling problems is considered. A mathematical programming formulation, in the form of a combinatorial optimization model, is also developed. Then a genetic algorithm is developed for solving the proposed problem. The efficiency of the developed algorithm is eva...

In this manuscript, a vehicle allocation problem involving a heterogeneous fleet of vehicles for delivering products from a manufacturing firm to a set of depots is considered. Each depot has a specific order quantity and transportation costs consist of fixed and variable transportation cost. The objective is to assign the proper type and number of...

The problem of allocating different types of vehicles for transporting a set of products from a manufacturer to its depots/cross docks, in an existing transportation network, to minimize the total transportation costs, is considered. The distribution network involves a heterogeneous fleet of vehicles, with a variable transportation cost and a fixed...

In this manuscript a new phenomenon of adjacency and closeness rating is proposed for constructing the optimal facility layout design. In the proposed approach, the closeness rating is applied to every pair of neighboring departments in a range of their attached point up to a predefined distance between them. Also, while in the traditional approach...

In this study a new version of adjacency, which provides a more flexible layout design, is proposed. In the proposed version, departments which are nonadjacent yet close to each other are considered to be adjacent with a smaller adjacency rating. It is shown that the proposed adjacency is a generalized version of the traditional adjacency. A mathem...

In recent years, the non-deterministic approaches for the hypothesis testing of statistical observations and data analysis have attracted great attentions. Descriptive inference statistics, such as point estimators, confidence interval estimators and hypothesis testing mechanisms have been emerged toward application of fuzzy techniques on the data...

Edited title The analysis of critical factors of success (failure) for Iran nanotechnology research & development via fuzzy map approach Abstract: Experiment is a procedure for verifying or establishing the validity of a hypothesis and then measuring or evaluating its outcomes. Due to the inherent uncertainties or ambiguities of its outcomes, a fu...

Experiment is a procedure for verifying or establishing the validity of a hypothesis and then measuring or evaluating its outcomes. Due to the inherent uncertainties or ambiguities of its outcomes, a further treatment is needed for producing identical results. Fuzzy map is an approach for removing the uncertainties of the outcomes. In this manuscri...

Multi-floor facility layout problem concerns the arrangement of departments on the different floors. In this paper, a new mathematical model is proposed for multi-floor layout with unequal department area. Maximising the number of useful adjacencies among departments is considered as the objective function. The adjacencies are divided into two majo...

In this paper, the tardiness flow shop models with intermediate due date were considered. The flow shop models consist of a set of jobs each having a number of operations, while each operation is performed in a single machine. All the jobs are considered having the same unidirectional precedence order. In the tardiness flow shop models with interme...

In this paper, the problem of scheduling commercial messages during the peak of viewing time of a TV channel is formulated as a combinatorial auction-based mathematical programming model. Through this model, a profitable and efficient mechanism for allocating the advertising time to advertisers is developed by which the revenue of TV channels is ma...

Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinator...

The main purpose of this study is to offer a new method for transient analysis of availability and survivability of a system with the identical components and one repairman and with every combination of components either standard system for example series systems, parallel systems, stand-by systems and K out of N systems or complex system. This met...

In this study, a method for transient analysis of availability and survivability of a system with the standby components is presented. The availability and survivability of the standby systems is evaluated in two cases, the standby systems with the identical components and the standby systems with the non-identical components. In this study the Mar...

Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. We consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. We modify the concept of cost over time (COVERT) for the generalized version of the flow shop tardiness model and empl...

A multiple-choice knapsack problem can be formulated as a discrete nonlinear knapsack problem (DNKP). A powerful method for solving DNKP is the dynamic programming solution approach. The use of this powerful approach however is limited since the growth of the number of decision variables and state variables requires an extensive computer memory sto...

In this paper we present a method for transient analysis of availability and survivability of a system with the identical components and identical repairmen. The considered system is supposed to consist of series of k-out-of-n or parallel components. We employed the Markov models, eigen vectors and eigenvalues for analyzing the transient availabili...

In this paper, the problem of determining the best schedule for a set of projects has been modeled in the form of a generalized tardiness flowshop (GTF) problem. We develop a set of heuristic algorithms for minimizing the total tardiness of jobs in a GTF problem. In the generalized version of tardiness flowshop problems, a job is considered to be a...

In this paper, the Markov models, eigenvectors and eigenvalue concepts a r e used to propose a methodology for analyzing the transient reliability of a system with identical components and identical repairmen. The components of the systems under consideration can have t w o distinct conngurations, namely; they can be arranged in series or in parall...

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global optimal solution even in the case of discrete solution space for these problems. Despite the power of this solution approach, it computationally performs...

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global optimal solution even in the case of discrete solution space for these problems. Despite the power of this solution approach, it computationally performs...

We introduce a network simulation model for detailed evaluation of the performance of different energy management policies in a MANET. In addition it presents an energy-aware network transaction protocol that dynamically redistributes the computational workload among a set of cooperative hosts within a MANET so as to improve network performance (ne...

Optimal allocation of operations to automated ma chines becomes more complex if the labor force or the machinery is heterogeneous. The stochastic nature of the system must also be considered. Thus the problem is a stochastic, integer, nonlinear con strained-optimization problem. We solve it by con structing a simulation model of the operator/machin...