Journal ArticleDOI
Solving Large Single-Model Assembly Line Balancing Problems—A Comparative Study
Reads0
Chats0
TLDR
A comparative study is made between three methods for balancing single-model assembly lines, 10-SP, which selects the best of ten single-pass solutions; ARCUS—a random multi-pass method, and MALB, an iterative backtracking method.Abstract:
A comparative study is made between three methods for balancing single-model assembly lines. These include: 10-SP, which selects the best of ten single-pass solutions; ARCUS—a random multi-pass method, and MALB, an iterative backtracking method. The assembly tasks contain up to 140 work elements with widely differing precedence structures. Measurements of the Balance Delay are used for comparing the solution efficiencies and computation times are also compared. The experiments show significant differences between the three line balancing methods and that these differences are accentuated for certain conditions of task size, precedence structure and the imposed balancing requirements. It is shown that 10-SP is yet another simple but effective technique for balancing single-model assembly lines.read more
Citations
More filters
Journal ArticleDOI
A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems
Soumen Ghosh,Roger J. Gagnon +1 more
TL;DR: In this article, the authors present a comprehensive review and analysis of the assembly line balancing literature at both the strategic and tactical levels, focusing on qualitative and quantitative factors that could impact the design, balancing and scheduling of assembly systems.
Journal ArticleDOI
A comparative evaluation of heuristic line balancing techniques
TL;DR: A computational experiment designed to assess the efficacy of 26 heuristic decision rules which group work tasks into work stations along an assembly line such that the number of work stations required is minimized is minimized.
Journal ArticleDOI
The U-line balancing problem
G. J. Miltenburg,J. Wijngaard +1 more
TL;DR: The U-line LB problem is introduced and modelled, and solution procedures are developed, more complex than the traditional LB problem because tasks can be grouped by moving forward, backward, or simultaneously in both directions, through the precedence network.
Journal ArticleDOI
Literature review of assembly line balancing problems
P. Sivasankaran,P. Shahabudeen +1 more
TL;DR: A comprehensive review of literature on the assembly line balancing is presented in this paper, where the main objectives of the design are to minimize the number of workstations for a given cycle time (type 1), minimize the maximum of the times of the workst stations (type 2), and so forth.
Journal ArticleDOI
Simple assembly line balancing—Heuristic approaches
Armin Scholl,Stefan Voß +1 more
TL;DR: Heuristics for Type 1 and Type 2 of the Simple Assembly Line Balancing Problem (SALBP) are described and bidirectional and dynamic extensions to heuristic priority rules widely used for SALBP-1 and 2 are described.
References
More filters
Journal ArticleDOI
A computer method of sequencing operations for assembly lines
TL;DR: In this article, the authors present a Monte-Carlo simulation of COMSOAL, an acronym for a computer Method of Sequencing Operations for Assembly Lines, which is a method of balancing large complex machine-paced assembly lines.
Book
Production-Inventory Systems: Planning and Control
TL;DR: In this article, the authors present a production-inventory systems: planning and control approach for the control of production-inventory systems in the field of OSSs, and discuss the following issues:
Journal ArticleDOI
An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
TL;DR: There are significant differences among the effectiveness results achieved by the line balancing techniques but there are few changes in the relative effectiveness of the computing techniques over the range of line lengths, partial ordering strengths, and problem sizes that were investigated.
Journal ArticleDOI
Assembly-Line Balancing---Dynamic Programming with Precedence Constraints
TL;DR: In this article, the assembly-line balancing problem is treated as a sequencing problem with precedence constraints that prohibit the occurrence of certain orderings, and a dynamic programming algorithm for the exact solution of small assembly line balancing problems is presented.
Journal ArticleDOI
MALB—A Heuristic Technique for Balancing Large Single-Model Assembly Lines
TL;DR: A heuristic algorithm for the general solution of large single-model assembly line balancing problems based on the optimum-seeking backtracking method proposed by Mansoor (1964), with excellent results from tests taken over a wide range of large ALB problems.