Volume 27, Issue 1 (7-2008)                   JCME 2008, 27(1): 35-50 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

R. Tavakkoli-Moghaddam, M. Rabbani, and M.A. Beheshti. Minimizing Stoppage Cost of an Assembly Line Using Genetic Algorithm. JCME 2008; 27 (1) :35-50
URL: http://jcme.iut.ac.ir/article-1-440-en.html
Abstract:   (4077 Views)
This paper presents a nonlinear mixed-integer programming model to minimize the stoppage cost of mixed-model assembly lines. Nowadays, most manufacturing firms employ this type of line due to the increasing varieties of products in their attempts to quickly respond to diversified customer demands. Advancement of new technologies, competitiveness, diversification of products, and large customer demand have encouraged practitioners to use different methods of improving production lines. Minimizing line stoppage is regarded as a main factor in determining the sequence of processing products. Line stoppage results in idleness of operators and machines, reduced throughput, increased overhead costs, and decreased overall productivity. Due to the complexity of the model proposed, which belongs to a class of NP-hard problems, a meta-heuristic method based on a genetic algorithm (GA) is proposed to obtain near-optimal solutions in reasonable time, especially for large-scale problems. To show the efficiency of the proposed GA, the computational results are compared with those obtained by the Lingo software.
Full-Text [PDF 406 kb]   (819 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25 | Published: 2008/07/15

Add your comments about this article : Your username or Email:

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

© 2022 CC BY-NC 4.0 | Computational Methods in Engineering

Designed & Developed by : Yektaweb