Balancing assembly lines effectively - A computational comparison

被引:76
|
作者
Scholl, A [1 ]
Klein, R [1 ]
机构
[1] Darmstadt Univ Technol, Inst Operat Res, Fac Business Adm, D-64289 Darmstadt, Germany
关键词
production scheduling; line balancing; computational experiment; branch and bound;
D O I
10.1016/S0377-2217(98)00173-8
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We report on results of a numerical experiment including the most effective branch and bound procedures for solving type 1 of the simple assembly line balancing problem (SALBP-1), namely Johnson's (1988) FABLE, Nourie and Venta's (1991) OptPack, Hoffmann's (1992) Eureka and Scholl and Klein's (1997) SALOME. It appears that SALOME clearly outperforms the other procedures with respect to hard instances of a new challenging data set. Beyond that, it is shown that the performance of SALOME can greatly be improved by adding some further features including dynamic renumbering and dominance rules. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:50 / 58
页数:9
相关论文
共 50 条