A method for assembly line balancing

Betts, Judith; Mahmoud, K.I.

doi:10.1016/0167-188x(89)90023-2

Cited by 21 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(6.2) Assign q ¼ q þ 1. (5) and then calculate d and j for the solution using equations (1) and (2) respectively. (6.5) If C < B u , update B u and B l as follows:…”

Section: Main Steps Of the Proposed Alb Methodsmentioning

confidence: 99%

“…An improved scheme is developed based on some existing ones (2,5), and is presented below. Consider a set of tasks that satisfies the precedence constraints if assigned to station k. Let T k be the sum of task times for this set of tasks.…”

Section: A Task Tree Enumeration Schemementioning

confidence: 99%

“…Consequently, many textbooks and industrial engineering handbooks continue to prescribe one or two heuristic methods that produce feasible, but by no means the best possible, solutions. In recent years some computer-based methods have become available and they do obtain better solutions, such as those developed by Johnson (2) and Betts and Mahmoud (5). The approach of applying genetic algorithms (GA) to the line balancing problem, developed by Minagawa and Kakazu (11), is another example.…”

Section: Introductionmentioning

confidence: 98%

See 2 more Smart Citations

Finding the best possible solutions to simple assembly line balancing problems

1997

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

Assembly line balancing (ALB) is an important aspect in the design of many flow line type manufacturing systems which may or may not be assembly oriented. It involves essentially assigning individual tasks into stations such that certain constraints are satisfied and some specified objectives achieved. Although this problem has attracted a great deal of research effort over the past forty years, it still remains unsolved. This paper presents a computer-based method for the simple assembly line balancing problem (SALBP). For a given problem, the method makes use of some efficient and systematic search and identification techniques to establish task trees for individual stations and to develop a station tree for multiple solutions. Different from all known existing assembly line balancing methods, this method aims at finding the best possible solutions that lead to the maximum production rate and the minimum station workload variation. The essential and distinct concepts adopted by the method are described in this paper, along with its step-by-step execution procedure and an illustrative example. Since the method does not involve difficult mathematics, many industrial practitioners can easily understand it and appreciate its effectiveness.

show abstract

“…(6.2) Assign q ¼ q þ 1. (5) and then calculate d and j for the solution using equations (1) and (2) respectively. (6.5) If C < B u , update B u and B l as follows:…”

Section: Main Steps Of the Proposed Alb Methodsmentioning

confidence: 99%

Section: A Task Tree Enumeration Schemementioning

confidence: 99%

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Finding the best possible solutions to simple assembly line balancing problems

1997

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

show abstract

A tabu search approach to the optimal sequential partitions of directed acyclic graphs

Kaji

Ohuchi

1997

Elect. Eng. Jpn.

View full text Add to dashboard Cite

Tabu search is a novel technique for solving combinatorial optimization problems. The process in which the tabu search method seeks to transcend local optimality is based on an evaluation function which chooses the highest‐evaluation move in terms of objective function and tabu restrictions. This paper presents a tabu search algorithm for finding a minimum‐cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relations are satisfied. A standard tabu search approach cannot realize good solutions for this problem, because the problem is a complex multiple partitioning problem in which the number of subsets and the number of nodes in each subset are unsettled. For this problem, we use an appropriate data structure for this method and develop effective neighborhood structure and heuristics. We also assess the effectiveness of the developed algorithm. The results show that this algorithm is effective in obtaining a near‐optimal solution to this problem. The running time of the procedure is proportional to the number of nodes in the graph. © 1997 Scripta Technica, Inc. Electr Eng Jpn, 119(4): 42–51, 1997

show abstract

An Effective Computer Based Assembly Line Balancing Method

Liu

1993

Proceedings of the Thirtieth International MATADOR Conference

View full text Add to dashboard Cite

A method for assembly line balancing

Cited by 21 publications

References 18 publications

Finding the best possible solutions to simple assembly line balancing problems

Finding the best possible solutions to simple assembly line balancing problems

A tabu search approach to the optimal sequential partitions of directed acyclic graphs

An Effective Computer Based Assembly Line Balancing Method

Contact Info

Product

Resources

About