A new heuristic method for mixed model assembly line balancing problem

Authors:
Mingzhou Jin;S. David Wu
Affiliations:
Department of Industrial Engineering, Mississippi State University, P.O. Box 9542, Mississippi State, MS;Department of Industrial and System Engineering, P.C. Rossin College of Engineering, Lehigh University, 200 West Packer Avenue, Bethlehem, PA
Venue:
Computers and Industrial Engineering
Year:
2003

Citing 1
Cited 7

Sequencing mixed-model assembly lines with genetic algorithms

Computers and Industrial Engineering

Heuristic transporter routing model for manufacturing facility design

Computers and Industrial Engineering - Special issue: Selected papers from the 27th international conference on computers & industrial engineering
Combining heuristic procedures and simulation models for balancing a PC camera assembly line

Computers and Industrial Engineering
A recursive operator allocation approach for assembly line-balancing optimization problem with the consideration of operator efficiency

Computers and Industrial Engineering
The search for the optimal number of kanbans in unstable assembly-tree layout systems under intensive loading conditions

International Journal of Computer Integrated Manufacturing - THE CHALLENGES OF MANUFACTURING IN THE GLOBALLY INTEGRATED ECONOMY. GUEST EDITOR: ROBIN G. QIU
Balancing of mixed-model two-sided assembly lines

Computers and Industrial Engineering
Combining heuristic procedures and simulation models for balancing a PC camera assembly line

Computers and Industrial Engineering
A Simulated Annealing algorithm for a mixed model assembly U-line balancing type-I problem considering human efficiency and Just-In-Time approach

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 'good' parts in the early sequence so that the whole performance of the solution is influenced. In this paper, we provide the definition of good parts and good remaining sequence and analyze their relationship with the optimal solution's objective function value. We develop a new heuristic algorithm called 'variance algorithm' the numerical experiments show that the new algorithm can yield better solution with little more computation overhead.