Showing 4 results for Kia
M. Nikian, , M. Naghashzadegan, S. K. Arya ,
Volume 17, Issue 3 (IJES 2006)
Abstract
The cylinder working fluid mean temperature, rate of heat fluxes to combustion chamber and temperature distribution on combustion chamber surface will be calculated in this research. By simulating thermodynamic cycle of engine, temperature distribution of combustion chamber will be calculated by the Crank-Nicolson method. An implicit finite difference method was used in this code. Special treatments for piston movement and a grid transformation for describing the realistic piston bowl shape were designed and utilized. The results were compared with a finite element method and were verified to be accurate for simplified test problems. In addition, the method was applied to realistic problems of heat transfer in an Isuzu Diesel engine, and gave good agreement with available experimental.
M. S Jabalameli, B. Bankian Tabrizi, M. Moshref Javadi ,
Volume 21, Issue 4 (IJIEPR 2010)
Abstract
The problem of locating distribution centers (DCs) is one of the most important issues in design of supply chain. In previous researches on this problem, each DC could supply products for all of the customers. But in many real word problems, DCs can only supply products for customers who are in a certain distance from the facility, coverage radius. Thus, in this paper a multi-objective integer linear programming (MOILP) model is proposed to locate DCs in a two-echelon distribution system. In this problem, customers who are in the coverage radius of the DCs can be supplied. Moreover, we suppose that the coverage radius of each DC can be controlled by decision maker and it is a function of the amount of money invested on the DC. Finally, a random generated problem is used to verify the model and the computational results are presented .
F. Khaksar-Haghani, N. Javadian, R. Tavakkoli-Moghaddam , A. Baboli , R. Kia,
Volume 22, Issue 3 (IJIEPR 2011)
Abstract
Dynamic cellular manufacturing systems, Mixed-integer non-linear programming, Production planning, Manufacturing attributes |
This paper presents a novel mixed-integer non-linear programming model for the design of a dynamic cellular manufacturing system (DCMS) based on production planning (PP) decisions and several manufacturing attributes. Such an integrated DCMS model with an extensive coverage of important design features has not been proposed yet and incorporates several manufacturing attributes including alternative process routings, operation sequence, processing time, production volume of parts, purchasing machine, duplicate machines, machine depot, machine capacity, lot splitting, material flow conservation equations, inflation coefficient, cell workload balancing, budget constraints for cell construction and machine procurement, varying number of formed cells, worker capacity, holding inventories and backorders, outsourcing part-operations, warehouse capacity, and cell reconfiguration. The objective of the integrated model is to minimize the total costs of cell construction, cell unemployment, machine overhead and machine processing, part-operations setup and production, outsourcing, backorders, inventory holding, material handling between system and warehouse, intra-cell and inter-cell movements, purchasing new machines, and machine relocation/installation/uninstallation. A comprehensive numerical example taken from the literature is solved by the Lingo software to illustrate the performance of the proposed model in handling the PP decisions and to investigate the incorporated manufacturing attributes in an integrated DCMS .
Kamran Kianfar, Ghasem Moslehi,
Volume 28, Issue 3 (IJIEPR 2017)
Abstract
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with rejection and hence, the results of this study are applicable for them. Initially, we present two approximation algorithms. Then, two special cases of the main problem are considered. In the first case, all jobs have the same tardiness weights where an FPTAS is developed using the technique of “structuring the execution of an algorithm". The second special case occurs when none of the jobs can be early. For this case, a 2-approximation algorithm is developed as well as a dynamic programming algorithm which is converted to an FPTAS.
