A heuristic program for assembly line balancing by Fred M. Tonge

Cover of: A heuristic program for assembly line balancing | Fred M. Tonge

Published by Prentice-Hall in Englewood Cliffs, N.J .

Written in English

Read online

Subjects:

  • Line of balance (Management)

Edition Notes

Book details

Statement[by] Fred M. Tonge.
Classifications
LC ClassificationsHD69.P7 T6
The Physical Object
Paginationxi, 115 p.
Number of Pages115
ID Numbers
Open LibraryOL5824341M
LC Control Number61011359
OCLC/WorldCa1705024

Download A heuristic program for assembly line balancing

A Heuristic Program for Assembly Line Balancing Hardcover – January 1, by Fred M. Tonge (Author)Author: Fred M. Tonge. Audio Books & Poetry Community Audio Computers, Technology and Science Music, Arts & Culture News & Public Affairs Non-English Audio Spirituality & Religion Librivox Free Audiobook Managing relationships - for iBooks InnovationCoach' Podcast KK Forever Girls Empowerment Network Podcasting HK» 部落格仔舖 Geekerati Ask Lev.

Genre/Form: Academic theses: Additional Physical Format: Online version: Tonge, Fred M. Heuristic program for assembly line balancing.

Englewood Cliffs, N.J. A Heuristic Program for Assembly Line Balancing Author: F. Tonge Subject: An application of heuristic procedures to solve the assembly-line-balancing problem. Assembly-line balancing is defined as a process of assigning jobs to workers stationed along a continuous assembly line.

Created Date: 4/18/ AM. Assembly-line balancing is defined as a process of assigning jobs to workers stationed along a continuous assembly line. The author attempts (1) to develop an acceptable, though not necessarily optimum, procedure for assembly-line balancing and (2) to discuss the use of computers for implementing heuristic decision procedures in the industrial.

A computer program incorporating the new heuristic method is presented in the paper. INTRODUCTION The assembly line is a production system in which work stations are sequentially arranged and assembly operations are performed as the product moves from one work station to the other.

The paper presents a proposal for solving the problem of line balancing with location constraints using new hybrid heuristic algorithm, which is a combination of a modified RPW algorithm and a local search of task sequence on assembly stations : Damian Krenczyk, Karol Dziki. 1. Introduction.

The assembly line balancing problem (ALBP) is a classic problem that has been tackled over the last 50 years.

A simplified view of the problem defines the balancing of an assembly line as the grouping of the tasks required to assemble the final product to the workstations conforming the assembly line. Meta-heuristic Approaches for the Assembly Line Balancing Assembly line balancing problem (ALBP) is a decision problem arising when designing or redesigning an assembly line and it consists in finding the optimal assignment of tasks among the workstations corresponding A heuristic program for assembly line balancing book some.

A critical assumption made in formulating the classical assembly line balancing model is that the line is ‘serial’ with no ‘paralleling’ of stations allowed. A model is proposed here which allows the paralleling of stations, thereby achieving a higher production rate and lower labour by: A Multiple-rule Heuristic for Assembly Line Balancing FAYEZ F.

BOCTOR Universite Laval, Canada This paper introduces a four-rule heuristic method for production/assembly line balancing which seeks to minimize the number of workstations for a given cycle time. To evaluate its performance.

For solving line balancing problems a number of methods are available, for example Heuristic, linear programming model, dynamic programming and comsoal (a computer method for sequencing operations for assembly lines).

For intermittent flow system normally heuristic methods are preferred. They are simple and involve less time and money.

slack time of the backward workstation j, in which Wb = C − T (BSj) There are two main steps in task assignment of the proposed heuristic. The first step is creation of new workstations.

In the bidirectional approach, tasks are allowed to be assigned to workstations from both ends of the assembly line. Calculation of cycle time. Determination of minimum number of workstation required. Using one of the heuristics to assign tasks to workstations for balancing production line.

COMPUTERIZED LINE BALANCING Line balancing by hand becomes unwieldy as the problems grow in size. There are software packages that will balance large lines quickly. Home Browse by Title Periodicals Computers and Industrial Engineering Vol. 57, No. 4 A new bidirectional heuristic for the assembly line balancing problem.

We have presented a new MIP model, a heuristic search procedure and an exact algorithm for solving the Assembly Line Worker Assignment and Balancing Problem of type 2. The new MIP model shows the importance of including continuity constraints in this type of problem, and its linear relaxation gives the current best lower bound for the problem.

A method for balancing a single‐model assembly line is described which incorporates various constraining features such as fixed position, positive and negative zoning, multiple parallel stations, etc. It can easily be extended for multiple manning of stations.

First a priority list of the elements is formed. For each element, its elemental time is added to those of its total number of Cited by: This paper presents a heuristic procedure for balancing production assembly lines and a computer program for carrying out that procedure.

This research was undertaken to investigate the application of complex information processing techniques (as used in producing the Chess Machine and Logic Theorist) to a typical industrial problem.

A typical balancing criterion is the maximum of a workload over all the periodical deliveries, which is to be minimized, e.g., the assembly line balancing problem of minimizing the cycle time (see.

SUMMARY An efficient single-pass heuristic method capable of finding good solutions for the single-model deterministic line balancing problem is presented.

The method involves four phases for simplifying a given problem, reducing its size and decomposing it into smaller subproblems when appropriate.

The solution is then found by using combinations of various heuristic by: This paper proposes a heuristic algorithm for two-sided assembly line balancing problem to minimize line length and smoothness index.

First, the branch-and-bound algorithm is adopted to find the solution with minimal line length. Then, the station neighborhood is defined. With the constraints of the line length, precedence and operational directions, some tasks are reassigned by comparing the.

ASSEMBLY LINE BALANCING USING EIGHT HEURISTICS R.B. Breginski, M.G. Cleto, J.L. Sass Junior Department of Production Engineering, Universidade Federal do Paraná, Cel.

Francisco Heráclito dos Santos,Curitiba, Paraná, Brazil Abstract The assembly line balancing File Size: KB. In parallel with the data obtained, the assembly line is firstly balanced by the Hoffman method, which is one of the heuristic methods.

Then the assembly line is balanced again using the Arena Simulation program and results which belong to two different assembly line balancing resolutions are by: 4. The assembly line balancing problem (ALBP) consists of assigning tasks to an ordered sequence of stations such that the precedence relations among the tasks are satisfied and some performance.

M Kilbridge and L Wester, "A Heuristic Method of Assembly Line Balancing," J Industrial No 4 (). Google Scholar J Mitchell, "A Computational Procedure for Balancing Zoned Assembly Lines," Research Report No R3, Westinghouse Research Laboratories, Pittsburgh, February, The goal chasing method is a popular algorithm in JIT system for the mixed model assembly line balancing problem.

It is simple and easy to implement, but it is a very greedy algorithm and uses up. The Flexible multi-manned assembly line balancing problem is presented. A mathematical model, a heuristic procedure, and lower bounds are presented.

Flexible station boundaries allow substantial line length reductions of up to 42%.Author: Thiago Cantos Lopes, Giuliano Vidal Pastre, Adalberto Sato Michels, Leandro Magatão. The general assembly line balancing problem with setups (GALBPS) was recently defined in the literature.

It adds sequence-dependent setup time considerations to the classical simple assembly line balancing problem (SALBP) as follows: whenever a task is assigned next to another at the same workstation, a setup time must be added to compute the global workstation time, thereby providing the.

Use of heuristics is considered to be a better choice for the mixedmodel assembly line balancing problem, - because it comes under combinatorial problem. But, the solution of a heuristic may not be very closer to the op- timal solution of this Size: 1MB.

In this study the simple choice rules (heuristics) used are derived from earlier applications of heuristic programming to the assembly line balancing problem. Repeated trials with probabilistic choice of simple rules are here viewed as an alternative method of organizing the appropriate selection and application of Cited by: Purpose: The purpose of this paper is to find the most efficient assembly line balancing solution across many heuristic line balancing methods, in assistance with a developed computer program.

A Heuristic Program for Assembly Line Balancing, Prentice Hall Inc., Englewood Cliffs, New Jersey, Ilker Baybars, "A SURVEY OF EXACT ALGORITHMS FOR THE SIMPLE ASSEMBLY LINE BALANCING PROBLEM," Management Science, August Abstract This paper studies the performance of a group of heuristic methods developed to solve the alternative subgraphs assembly line balancing problem.

This problem implies selecting an assembly. Assembly line balancing problem: A comparative evaluation of heuristics and a computational assessment of objectives.

“A dynamic programming based heuristic for the assembly line balancing. A New COMSOAL Based Heuristic Approach to Mixed Model Assembly Line Balancing with Parallel Workstations and Zoning Constraints Ramazan YAMAN and Ibrahim KUCUKKOC Balikesir University, Department of Industrial Engineering, Cagis Campus, Balikesir / Turkey [email protected], [email protected] YAEM/, Sakarya.

Guidelines are also given to those balancing industrial assembly lines on the choice of the heuristic decision rule to use whether one is attempting to obtain a minimum station balance given a limit on the time available for assembly at each work station, or whether one is attempting to minimize the time devoted to assembly at a work station.

Assembly Systems and Line Balancing *Discrete products are assembled from components. The Assembly Process Definition: assembly involves the joining together of two or more separate parts to form a new entity (assembly or subassembly).

*The processes used to accomplish the assembly of the components can be divided into three major categories. Size: KB. Basic heuristic algorithms have been widely used to solve the assembly line balancing problem (ALBP).

However, to solve hard, large-scale ALBPs, efficient decision tools are essential. Therefore, developing efficient algorithms that can yield optimal or near-optimal solutions is of utmost importance. Moodie, C. and Young, H. H., "A Heuristic Method of Assembly Line Balancing for Assumptions of Constant or Variable Work Element Times," J.

Industrial Engineering, 16, 1, 23–29 (). Google Scholar. Line balancing is the problem of assigning operation to workstation along an assembly line, in such a way that assignment is optimal in some sense.

This project mainly focuses on improving overall efficiency of single model assembly line by reducing the bottleneck activities, cycle time and distribution of work load at each work station by line Cited by: 1.

A heuristic method of assembly line balancing for assumptions of constant or variable work element times.The definitive guide to the disassembly line The Disassembly Line: Balancing and Modeling provides in-depth information on this complex process essential to remanufacturing, recycling, and environmentally conscious manufacturing.

This pioneering work offers efficient techniques required to solve problems involving the number of workstations required and the disassembly sequencing of end-of. The purpose of this paper is to find the most efficient assembly line balancing solution across many heuristic line balancing methods, in assistance with a developed computer program.,In this paper, assembly line balancing problem was analyzed using t-shirt and knitted pants data.

A computer program using MATLAB software for the solution of assembly line balancing problems Cited by: 4.

45655 views Friday, November 20, 2020