Difficulties in estimation the quality of assembly line balancing problem

被引:0
作者
Grzechca, Waldemar [1 ]
机构
[1] Silesian Tech Univ, Fac Automat Control Elect & Comp Sci, Gliwice, Poland
来源
2015 20TH INTERNATIONAL CONFERENCE ON METHODS AND MODELS IN AUTOMATION AND ROBOTICS (MMAR) | 2015年
关键词
assembly line balancing problem; heuristic; line efficiency; smoothness index; time of the line; ALGORITHMS;
D O I
10.1109/MMAR.2015.7284046
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The paper describes difficulties in estimation of the quality of assembly line balancing problem (ALBP). The mentioned problem is NP-hard and even optinud solutions can contain idle times. The objective of optimization ALBP is to minimize the number of workstations on an assembly line for a given cycle time (TYPE 1) or to minimize the value of cycle time for a given number of workstations (TYPE 2). Since more than 50 years many exact and heuristic methods were introduced to solve the problem. As a result we get sequence of assigned tasks to the workstations of the assembly line. The additional problem is to choose appropriate solutions because of existing idle times. Some quality performances help to estimate the final results. In this paper efficiency line, smoothness index and time of the line are discussed Author underlines the problem of differences between cycle time and maximum station load Numerical examples are presented and conclusion are given.
引用
收藏
页码:1179 / 1184
页数:6
相关论文
共 24 条