تعداد نشریات | 418 |
تعداد شمارهها | 9,997 |
تعداد مقالات | 83,560 |
تعداد مشاهده مقاله | 77,801,377 |
تعداد دریافت فایل اصل مقاله | 54,843,985 |
A cost-oriented model for multi-manned assembly line balancing problem | ||
Journal of Optimization in Industrial Engineering | ||
مقاله 2، دوره 6، شماره 13، آذر 2013، صفحه 13-25 اصل مقاله (3.74 M) | ||
نوع مقاله: Original Manuscript | ||
نویسندگان | ||
Abolfazl Kazemi* 1؛ Abdolhossein Sedighi2 | ||
1Department of industrial engineering, Islamic Azad University, Qazvin Branch, Qazvin Iran | ||
2Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran | ||
چکیده | ||
In many real world assembly line systems which the work-piece is of large size more than one worker work on the same work-piece in each station. This type of assembly line is called multi-manned assembly line (MAL). In the classical multi-manned assembly line balancing problem (MALBP) the objective is to minimize the manpower needed to manufacture one product unit. Apart from the manpower, other cost drivers like wage rates or machinery are neglected in this classical view of the problem. However due to the high competition in the current production environment, reducing the production costs and increasing utilization of available resources are very important issues for manufacturing managers. In this paper a cost-oriented approach is used to model the MALBP with the aim of minimizing total cost per production unit. A mathematical model is developed to solve the problem. Since the proposed model is NP-hard, several heuristic algorithms and a genetic algorithm (GA) are presented to efficiently solve the problem. Parameters and operators of the GA are selected using the design of experiments (DOE) method. Several examples are solved to illustrate the proposed model and the algorithms. | ||
کلیدواژهها | ||
Multi-manned assembly line؛ Cost-oriented approach؛ Heuristic؛ Genetic Algorithm؛ Design of experiments | ||
آمار تعداد مشاهده مقاله: 3,909 تعداد دریافت فایل اصل مقاله: 3,405 |