Optimally balancing assembly lines with different workstations

被引：51

作者：

Nicosia, G

Pacciarelli, D

Pacifici, A

机构：

[1] Univ Roma Tor Vergata, Dipartimento Informat Sistemi & Prod, I-00133 Rome, Italy

[2] Univ Roma Tor Vergata, Dipartimento Informat & Automazione, I-00146 Rome, Italy

来源：

DISCRETE APPLIED MATHEMATICS | 2002年 / 118卷 / 1-2期

关键词：

assembly line balancing; dynamic programming; branch and bound; computational complexity;

D O I：

10.1016/S0166-218X(01)00259-1

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, we consider the problem of assigning operations to an ordered sequence of non-identical workstations, observing precedence relationships and cycle time restrictions. The objective is to minimize the cost of the workstations. We first present a dynamic programming algorithm, and introduce several fathoming rules in order to reduce the number of states in the dynamic program. A characterization of a wide class of polynomially solvable instances is given, and computational results are reported. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：99 / 113

页数：15

共 29 条

[1]

[Anonymous], 1988, INT J FLEX MANUF SYS, DOI DOI 10.1007/BF00713158

[2]

Askin R.G., 1993, MODELING ANAL MANUFA

[3] A SURVEY OF EXACT ALGORITHMS FOR THE SIMPLE ASSEMBLY LINE BALANCING PROBLEM [J].