Volume 25, Issue 1 (IJIEPR 2014)                   IJIEPR 2014, 25(1): 1-12 | Back to browse issues page

XML Print

1- of Industrial Engineering, Bu-Ali Sina University , fattahi@basu.ac.ir
2- Department of Industrial Engineering, Payame Noor University
3- Department of Industrial Engineering, College of engineering, University of Tehran
4- Department of Industrial Engineering, Payame Noor University, Tehran, Iran,
Abstract:   (4440 Views)
A three stage production system is considered in this paper. There are two stages to fabricate and ready the parts and an assembly stage to assembly the parts and complete the products in this system. Suppose that a number of products of different kinds are ordered. Each product is assembled with a set of several parts. At first the parts are produced in the first stage with parallel machines and then they are controlled and ready in the second stage and finally the parts are assembled in an assembly stage to produce the products. Two objective functions are considered that are: (1) to minimizing the completion time of all products (makespan), and (2) minimizing the sum of earliness and tardiness of all products (∑_i▒(E_i∕T_i ) . Since this type of problem is NP-hard, a new multi-objective algorithm is designed for searching locally Pareto-optimal frontier for the problem. To validate the performance of the proposed algorithm, in terms of solution quality and diversity level, various test problems are made and the reliability of the proposed algorithm, based on some comparison metrics, is compared with two prominent multi-objective genetic algorithms, i.e. NSGA-II and SPEA-II. The computational results show that performance of the proposed algorithms is good in both efficiency and effectiveness criterions.
Full-Text [PDF 1445 kb]   (2751 Downloads)    
Type of Study: Research | Subject: Production Planning & Control
Received: 2013/03/13 | Accepted: 2013/10/26 | Published: 2014/02/25