A versatile algorithm for assembly line balancing

被引:54
作者
Boysen, Nils [1 ]
Fliedner, Malte [1 ]
机构
[1] Univ Hamburg, Inst Ind Management, D-20146 Hamburg, Germany
关键词
production; general assembly line balancing (GALBP); shortest-path algorithm;
D O I
10.1016/j.ejor.2006.11.006
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper discusses a two stage graph-algorithm, which was designed to solve line balancing problems including practice relevant constraints (GALBP), such as parallel work stations and tasks, cost synergies, processing alternatives, zoning restrictions, stochastic processing times or U-shaped assembly lines. Unlike former procedures, the presented approach can be easily modified to incorporate all of the named extensions. It is not only possible to select and solve single classes of constraints, but rather any combination of them with just slight modifications. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:39 / 56
页数:18
相关论文
共 94 条
[61]   ASSEMBLY-LINE BALANCING - ZERO-ONE PROGRAMMING WITH FIBONACCI SEARCH [J].
PATTERSON, JH ;
ALBRACHT, JJ .
OPERATIONS RESEARCH, 1975, 23 (01) :166-172
[62]   Assembly system design: A branch and cut approach [J].
Pinnoi, A ;
Wilhelm, WE .
MANAGEMENT SCIENCE, 1998, 44 (01) :103-118
[63]   A family of hierarchical models for the design of deterministic assembly systems [J].
Pinnoi, A ;
Wilhelm, WE .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1997, 35 (01) :253-280
[64]   ASSEMBLY LINE BALANCING WITH PROCESSING ALTERNATIVES - AN APPLICATION [J].
PINTO, PA ;
DANNENBRING, DG ;
KHUMAWALA, BM .
MANAGEMENT SCIENCE, 1983, 29 (07) :817-830
[65]   BRANCH AND BOUND AND HEURISTIC PROCEDURES FOR ASSEMBLY LINE BALANCING WITH PARALLELING OF STATIONS [J].
PINTO, PA ;
DANNENBRING, DG ;
KHUMAWALA, BM .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1981, 19 (05) :565-576
[66]   A MINIMAL ALGORITHM FOR THE MULTIPLE-CHOICE KNAPSACK-PROBLEM [J].
PISINGER, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 83 (02) :394-410
[67]   A multi-objective genetic algorithm for solving assembly line balancing problem [J].
Ponnambalam, SG ;
Aravindan, P ;
Naidu, GM .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2000, 16 (05) :341-352
[68]   BOUNDS FOR ASSEMBLY LINE BALANCING HEURISTICS [J].
QUEYRANNE, M .
OPERATIONS RESEARCH, 1985, 33 (06) :1353-1359
[69]   Hybrid assembly line design and user's preferences [J].
Rekiek, B ;
De Lit, P ;
Delchambre, A .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2002, 40 (05) :1095-1111
[70]   A multiple objective grouping genetic algorithm for assembly line design [J].
Rekiek, B ;
De Lit, P ;
Pellichero, F ;
L'Eglise, T ;
Fouda, P ;
Falkenauer, E ;
Delchambre, A .
JOURNAL OF INTELLIGENT MANUFACTURING, 2001, 12 (5-6) :467-485