State-of-the-art exact and heuristic solution procedures for simple assembly line balancing

被引:584
作者
Scholl, A [1 ]
Becker, C [1 ]
机构
[1] Univ Jena, Fak Wirtschaftswissensch, D-07743 Jena, Germany
关键词
assembly line balancing; mass-production; literature survey; combinatorial optimization; branch-and-bound; heuristics;
D O I
10.1016/j.ejor.2004.07.022
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The assembly line balancing problem arises and has to be solved when an assembly line has to be configured or redesigned. It consists of distributing the total workload for manufacturing any unit of the product to be assembled among the work stations along the line. The so-called simple assembly line balancing problem (SALBP), a basic version of the general problem, has attracted attention of researchers and practitioners of operations research for almost half a century. In this paper, we give an up-to-date and comprehensive survey of SALBP research with a special emphasis on recent outstanding and guiding contributions to the field. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:666 / 693
页数:28
相关论文
共 115 条
[1]  
Aarts E., 1989, Wiley-Interscience Series in Discrete Mathematics and Optimization
[2]   Applying genetic algorithms to the U-shaped assembly line balancing problem [J].
Ajenblit, DA ;
Wainwright, RL .
1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :96-101
[3]  
ALVIM ACF, 2003, HYBRID IMPROVEMENT H
[4]  
Anderson E. J., 1994, ORSA Journal on Computing, V6, P161, DOI 10.1287/ijoc.6.2.161
[5]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[6]  
[Anonymous], 1997, Tabu Search
[7]  
Arcus A. L., 1966, INT J PROD RES, V4, P259, DOI [https://doi.org/10.1080/00207546508919982, DOI 10.1080/00207546508919982]
[8]   AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH 0-1 VARIABLES [J].
BALAS, E .
OPERATIONS RESEARCH, 1965, 13 (04) :517-&
[9]  
Bautista J., 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), P2404, DOI 10.1109/ROBOT.2000.846387
[10]  
BAUTISTA J, 2002, P LECT NOTES COMP SC, V2463, P65